Result 1 to 20 of 855 total
A hybrid human dynamics model on analyzing hotspots in social networks. (English)
Discrete Dyn. Nat. Soc. 2012, Article ID 678286, 13 p. (2012).
1
A novel f-pad for handwriting force information acquisition. (English)
Huang, De-Shuang (ed.) et al., Intelligent computing theories and applications. 8th international conference, ICIC 2012, Huangshan, China, July 25‒29, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31575-6/pbk). Lecture Notes in Computer Science 7390. Lecture Notes in Artificial Intelligence, 138-144 (2012).
2
List point arboricity of graphs. (English)
Discrete Math. Algorithms Appl. 4, No. 2, 1250027,10p. (2012).
3
Fully polynomial-time approximation schemes for the max-min connected partition problem on interval graphs. (English)
Discrete Math. Algorithms Appl. 4, No. 1, 1250005, 9 p. (2012).
4
Proximity and average eccentricity of a graph. (English)
Inf. Process. Lett. 112, No. 10, 392-395 (2012).
5
Meshless simulation of plastic deformation and crack. (English)
Pan, Zhigeng (ed.) et al., Transactions on Edutainment VIII. Berlin: Springer (ISBN 978-3-642-31438-4/pbk). Lecture Notes in Computer Science 7220. Journal Subline, 127-137 (2012).
6
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).
7
On the maximum disjoint paths problem on edge-colored graphs. (English)
Discrete Optim. 9, No. 1, 50-57 (2012).
8
Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs. (English)
Appl. Math. Lett. 25, No. 3, 237-244 (2012).
9
A new trust region method with adaptive radius for unconstrained optimization. (English)
Optim. Methods Softw. 27, No. 3, 419-429 (2012).
10
Convex image segmentation model based on local and global intensity fitting energy and split Bregman method. (English)
J. Appl. Math. 2012, Article ID 692589, 16 p. (2012).
11
Properties and applications of Laplacian spectra for Koch networks. (English)
J. Phys. A, Math. Theor. 45, No. 2, Article ID 025102, 11 p. (2012).
12
Split Bregman method for minimization of improved active contour model combining local and global information dynamically. (English)
J. Math. Anal. Appl. 389, No. 1, 351-366 (2012).
13
Computing statistics under interval and fuzzy uncertainty. Applications to computer science and engineering. (English)
Studies in Computational Intelligence 393. Berlin: Springer (ISBN 978-3-642-24904-4/hbk; 978-3-642-24905-1/ebook). xi, 430~p. EUR~129.95/net; SFR~173.00; \sterling~117.00; \$~179.00 (2012).
14
A new variational Bayesian algorithm with application to human mobility pattern modeling (English)
Statistics and Computing 22, No. 1, 185-203 (2012).
15
On the spectral radius of unicyclic graphs with fixed maximum degree. (English)
Ars Comb. 102, 21-31 (2011).
16
On chromatic number of graphs without certain induced subgraphs. (English)
Ars Comb. 101, 33-44 (2011).
17
A novel genetic algorithm for overlapping community detection. (English)
Tang, Jie (ed.) et al., Advanced data mining and applications. 7th international conference, ADMA 2011, Beijing, China, December 17‒19, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-25852-7/pbk). Lecture Notes in Computer Science 7120. Lecture Notes in Artificial Intelligence, 97-108 (2011).
18
A conjecture on average distance and diameter of a graph. (English)
Discrete Math. Algorithms Appl. 3, No. 3, 337-342 (2011).
19
Nordhaus-Gaddum-type theorem for diameter of graphs when decomposing into many parts. (English)
Discrete Math. Algorithms Appl. 3, No. 3, 305-310 (2011).
20
Result 1 to 20 of 855 total
Start
Contact
Print
General Help
