Result 1 to 20 of 265 total
Improved constant-time approximation algorithms for maximum matchings and other optimization problems. (English)
SIAM J. Comput. 41, No. 4, 1074-1093 (2012).
1
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).
2
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).
3
An online algorithm optimally self-tuning to congestion for power management problems. (English)
Solis-Oba, Roberto (ed.) et al., Approximation and online algorithms. 9th international workshop, WAOA 2011, Saarbrücken, Germany, September 8‒9, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-29115-9/pbk). Lecture Notes in Computer Science 7164, 35-48 (2012).
4
Property testing on $k$-vertex-connectivity of graphs. (English)
Algorithmica 62, No. 3-4, 701-712 (2012).
5
Special issue: Selected papers based on the presentations at the Japan conference on computational geometry and graphs (JCCGG2009), Kanazawa, Japan, November 11‒13, 2009. (English)
Graphs Comb. 27, No. 3, 305-473 (2011).
6
A pseudorandom number generator using an Artin-Schreier tower. (English)
SUT J. Math. 47, No. 1, 73-90 (2011).
7
Face image annotation and retrieval in impressive words using minimum bounding rectangles of face parts. (English)
König, Andreas (ed.) et al., Knowledge-based and intelligent information and engineering systems. 15th international conference, KES 2011, Kaiserslautern, Germany, September 12‒14, 2011. Proceedings, Part IV. Berlin: Springer (ISBN 978-3-642-23865-9/pbk). Lecture Notes in Computer Science 6884. Lecture Notes in Artificial Intelligence, 34-43 (2011).
8
Making polygons by simple folds and one straight cut. (English)
Akiyama, Jin (ed.) et al., Computational geometry, graphs and applications. 9th international conference, CGGA 2010, Dalian, China, November 3‒6, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-24982-2/pbk). Lecture Notes in Computer Science 7033, 27-43 (2011).
9
A tower of Artin-Schreier extensions of finite fields and its applications. (English)
JP J. Algebra Number Theory Appl. 22, No. 2, 111-125 (2011).
10
Complexity of the stamp folding problem. (English)
Wang, Weifan (ed.) et al., Combinatorial optimization and applications. 5th international conference, COCOA 2011, Zhangjiajie, China, August 4‒6, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22615-1/pbk). Lecture Notes in Computer Science 6831, 311-321 (2011).
11
Constant-time algorithms for sparsity matroids. (English)
Comput. Res. Repos. 2011, Article No. 1103.2581 (2011).
12
An efficient computational architecture for a collision early-warning system for vehicles, pedestrians, and bicyclists (English)
IEEE Transactions on Intelligent Transportation Systems 12, No. 4, 942-953 (2011).
13
io-port 50117789 Takamatsu, Yoshimitsu;
Fujimoto, Ryuichi;
Sekine, Tsuyoshi;
Yasuda, Takaya;
Nakamura, Mitsumasa;
Hirakawa, Takuya;
Ishii, Masato;
Hayashi, Motohiko;
Ito, Hiroya;
Wada, Yoko;
Imayama, Teruo;
Oomoto, Tatsuro;
Ogasawara, Yosuke;
Nishikawa, Masaki;
Yoshida, Yoshihiro;
Yoshioka, Kenji;
Saigusa, Shigehito;
Yoshida, Hiroshi;
Itoh, Nobuyuki
A single-chip RF tuner/OFDM demodulator for mobile digital TV application (English)
IEICE Transactions 94-C, No. 4, 557-566 (2011).
14
Distribution-controlled X-identification for effective reduction of launch-induced IR-drop in at-speed scan testing (English)
IEICE Transactions 94-D, No. 6, 1216-1226 (2011).
15
Construction of BILBO FF with soft-error-tolerant capability (English)
IEICE Transactions 94-D, No. 5, 1045-1050 (2011).
16
Test sets for robust path delay fault testing on two-rail logic circuits (English)
IEEE Trans. Computers 60, No. 10, 1459-1470 (2011).
17
Arrangements of $n$ points whose incident-line-numbers are at most $n/2$ (English)
Graphs and Combinatorics 27, No. 3, 321-326 (2011).
18
Preface (English)
Graphs and Combinatorics 27, No. 3, 305-306 (2011).
19
Face image annotation and retrieval in impressive words using minimum bounding rectangles of face parts (English)
KES (4), 34-43 (2011).
20
Result 1 to 20 of 265 total
Start
Contact
Print
General Help
