Result 1 to 20 of 594 total
Competitive algorithms for online pricing. (English)
Discrete Math. Algorithms Appl. 4, No. 2, 1250015, 14p. (2012).
1
2D sparse signal recovery via 2D orthogonal matching pursuit. (English)
Sci. China, Inf. Sci. 55, No. 4, 889-897 (2012).
2
Theory and verification of operator design methodology. (English)
Sci. China, Inf. Sci. 55, No. 2, 480-490 (2012).
3
Weighted inverse minimum cut problem under the sum-type Hamming distance. (English)
Snoeyink, Jack (ed.) et al., Frontiers in algorithmics and algorithmic aspects in information and management. Joint international conference, FAW-AAIM 2012, Beijing, China, May 14‒16, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29699-4/pbk). Lecture Notes in Computer Science 7285, 26-35 (2012).
4
Group search optimizer based optimal location and capacity of distributed generations. (English)
Neurocomputing 78, 55-63 (2012).
5
High-frequency and low-frequency chest compression: effects on lung water secretion, mucus transport, heart rate, and blood pressure using a trapezoidal source pressure waveform (English)
IEEE Trans. Biomed. Engineering 59, No. 1, 106-114 (2012).
6
Image restoration algorithm using APEX method based on dark channel prior. (Chinese)
J. Comput. Appl. 31, No. 9, 2509-2511 (2011).
7
Industrial design using interpolatory discrete developable surfaces. (English)
Comput.-Aided Des. 43, No. 9, 1089-1098 (2011).
8
Current noise cross correlations and dynamical spin entanglement in coupled quantum dots. (English)
Quantum Inf. Comput. 11, No. 7-8, 606-614 (2011).
9
Research on OSS in the application of education information technology. (English)
Lin, Song (ed.) et al., Advances in computer science, environment, ecoinformatics, and education. International conference, CSEE 2011, Wuhan, China, August 21‒22, 2011. Proceedings, Part IV. Berlin: Springer (ISBN 978-3-642-23338-8/pbk; 978-3-642-23339-5/ebook). Communications in Computer and Information Science 217, 66-70 (2011).
10
A method of multiple odors detection and recognition. (English)
Jacko, Julie A. (ed.), Human-computer interaction. Interaction techniques and environments. 14th international conference, HCI international 2011, Orlando, FL, USA, July 9‒14, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-21604-6/pbk). Lecture Notes in Computer Science 6762, 464-473 (2011).
11
Mortal particles: Particle swarm optimization with life span. (English)
Tan, Ying (ed.) et al., Advances in swarm intelligence. Second international conference, ICSI 2011, Chongqing, China, June 12‒15, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-21514-8/pbk). Lecture Notes in Computer Science 6728, 138-146 (2011).
12
Cross-lingual sentiment classification via bi-view non-negative matrix tri-factorization. (English)
Huang, Joshua Zhexue (ed.) et al., Advances in knowledge discovery and data mining. 15th Pacific-Asia conference, PAKDD 2011, Shenzhen, China, May 24‒27, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-20840-9/pbk). Lecture Notes in Computer Science 6634. Lecture Notes in Artificial Intelligence, 289-300 (2011).
13
On solutions to backward stochastic partial differential equations for Lévy processes. (English)
J. Comput. Appl. Math. 235, No. 18, 5411-5421 (2011).
14
Parallel hash function construction based on coupled map lattices. (English)
Commun. Nonlinear Sci. Numer. Simul. 16, No. 7, 2810-2821 (2011).
15
Distributed dynamic mobile multicast. (English)
J. Parallel Distrib. Comput. 71, No. 9, 1215-1224 (2011).
16
List version of $(p,1)$-total labellings. (English)
Comput. Res. Repos. 2011, Article No. 1105.1906 (2011).
17
Effect of depreciation of the public goods in spatial public goods games. (English)
Comput. Res. Repos. 2011, Article No. 1104.0151 (2011).
18
Predicting protein folding rates using the concept of chou’s pseudo amino acid composition. (English)
J. Comput. Chem. 32, No. 8, 1612-1617 (2011).
19
Incremental mining of processes with loops. (English)
Int. J. Artif. Intell. Tools 20, No. 1, 221-235 (2011).
20
Result 1 to 20 of 594 total
Start
Contact
Print
General Help
