Result 1 to 20 of 202 total
Improved constant-time approximation algorithms for maximum matchings and other optimization problems. (English)
SIAM J. Comput. 41, No. 4, 1074-1093 (2012).
1
Approximation guarantees for the minimum linear arrangement problem by higher eigenvalues. (English)
Gupta, Anupam (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 15th international workshop, APPROX 2012, and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15‒17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32511-3/pbk). Lecture Notes in Computer Science 7408, 313-324 (2012).
2
Algorithms for finding a maximum non-$k$-linked graph. (English)
SIAM J. Discrete Math. 26, No. 2, 591-604 (2012).
3
Abdominal multi-organ segmentation of CT images based on hierarchical spatial modeling of organ interrelations. (English)
Yoshida, Hiroyuki (ed.) et al., Abdominal imaging. Computational and clinical applications. Third international workshop, held in conjunction with MICCAI 2011, Toronto, ON, Canada, September 18, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-28556-1/pbk). Lecture Notes in Computer Science 7029, 173-180 (2012).
4
Algorithms and complexity of generalized river crossing problems. (English)
Kranakis, Evangelos (ed.) et al., Fun with algorithms. 6th international conference, FUN 2012, Venice, Italy, June 4‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30346-3/pbk). Lecture Notes in Computer Science 7288, 235-244 (2012).
5
Constant-time approximation algorithms for the knapsack problem. (English)
Agrawal, Manindra (ed.) et al., Theory and applications of models of computation. 9th annual conference, TAMC 2012, Beijing, China, May 16‒21, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29951-3/pbk). Lecture Notes in Computer Science 7287, 131-142 (2012).
6
Testing the $(s,t)$ connectivity of graphs and digraphs. (English)
Theor. Comput. Sci. 434, 98-113 (2012).
7
On the distance between non-isomorphic groups. (English)
Eur. J. Comb. 33, No. 4, 474-476 (2012).
8
Property testing on $k$-vertex-connectivity of graphs. (English)
Algorithmica 62, No. 3-4, 701-712 (2012).
9
A generalized extension theorem for linear codes. (English)
Des. Codes Cryptography 62, No. 1, 121-130 (2012).
10
Algorithms for finding a maximum non-$k$-linked graph. (English)
Demetrescu, Camil (ed.) et al., Algorithms ‒ ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5‒9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 131-142 (2011).
11
A dynamic value-at-risk portfolio model. (English)
Torra, Vicenç (ed.) et al., Modeling decision for artificial intelligence. 8th international conference, MDAI 2011, Changsha, Hunan, China, July 28-30, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22588-8/pbk). Lecture Notes in Computer Science 6820. Lecture Notes in Artificial Intelligence, 43-54 (2011).
12
Property testing for cyclic groups and beyond. (English)
Fu, Bin (ed.) et al., Computing and combinatorics. 17th annual international conference, COCOON 2011, Dallas, TX, USA, August 14‒16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22684-7/pbk). Lecture Notes in Computer Science 6842, 432-443 (2011).
13
Testing list H-homomorphisms. (English)
Comput. Res. Repos. 2011, Article No. 1106.3126 (2011).
14
Property testing for cyclic groups and beyond. (English)
Comput. Res. Repos. 2011, Article No. 1105.1842 (2011).
15
Constant-time algorithms for sparsity matroids. (English)
Comput. Res. Repos. 2011, Article No. 1103.2581 (2011).
16
Dimensionality reduction for histogram features based on supervised non-negative matrix factorization (English)
IEICE Transactions 94-D, No. 10, 1870-1879 (2011).
18
Augmenting training samples with a large number of rough segmentation datasets (English)
IEICE Transactions 94-D, No. 10, 1880-1888 (2011).
19
Chaos-based communications using open-plus-closed-loop control (English)
IEICE Transactions 94-A, No. 1, 282-289 (2011).
20
Result 1 to 20 of 202 total
Start
Contact
Print
General Help
