Result 1 to 20 of 748 total
The pebbling number of squares of even cycles. (English)
Discrete Math. 312, No. 21, 3203-3211 (2012).
1
Pebbling number of squares of odd cycles. (English)
Discrete Math. 312, No. 21, 3174-3178 (2012).
2
Energy efficiency analysis for flexible-grid OFDM-based optical networks. (English)
Comput. Netw. 56, No. 10, 2400-2419 (2012).
3
On the complexity of the evaluation of transient extensions of Boolean functions. (English)
Int. J. Found. Comput. Sci. 23, No. 1, 21-35 (2012).
4
Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages. (English)
Theor. Comput. Sci. 449, 37-53 (2012).
5
Face aging simulation based on NMF algorithm with sparseness constraints. (English)
Huang, De-Shuang (ed.) et al., Advanced intelligent computing theories and applications. With aspects of artificial intelligence. 7th international conference, ICIC 2011, Zhengzhou, China, August 11‒14, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25943-2/pbk). Lecture Notes in Computer Science 6839. Lecture Notes in Artificial Intelligence, 516-522 (2012).
6
Fast and near-optimal matrix completion via randomized basis pursuit. (English)
Ji, Lizhen (ed.) et al., Fifth international congress of Chinese mathematicians. Proceedings of the ICCM ’10, Beijing, China, December 17‒22, 2010. Part 2. Providence, RI: American Mathematical Society (AMS); Somerville, MA: International Press (ISBN 978-0-8218-7587-2/pbk; 978-0-8218-7555-1/set). AMS/IP Studies in Advanced Mathematics 51, pt.2, 859-881 (2012).
7
On-line extreme learning machine for training time-varying neural networks. (English)
Huang, De-Shuang (ed.) et al., Bio-inspired computing and applications. 7th international conference on intelligent computing, ICIC 2011, Zhengzhou, China, August 11‒14. 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-24552-7/pbk). Lecture Notes in Computer Science 6840. Lecture Notes in Bioinformatics, 49-54 (2012).
8
The cubic spherical optimization problems. (English)
Math. Comput. 81, No. 279, 1513-1525 (2012).
9
Identity-based encryption resilient to continual auxiliary leakage. (English)
Pointcheval, David (ed.) et al., Advances in cryptology ‒ EUROCRYPT 2012. 31st annual international conference on the theory and applications of cryptographic techniques, Cambridge, UK, April 15‒19, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29010-7/pbk). Lecture Notes in Computer Science 7237, 117-134 (2012).
10
On sum coloring and sum multi-coloring for restricted families of graphs. (English)
Theor. Comput. Sci. 418, 1-13 (2012).
11
A feature group weighting method for subspace clustering of high-dimensional data. (English)
Pattern Recognition 45, No. 1, 434-446 (2012).
12
A formal theory for the complexity class associated with the stable marriage problem. (English)
Bezem, Marc (ed.), Computer science logic (CSL’11). 25th international workshop, 20th annual conference of the EACSL, Bergen, Norway, September 12‒15, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-32-3). LIPICS ‒ Leibniz International Proceedings in Informatics 12, 381-395, electronic only (2011).
13
Application of statistical modelling methods for finding the non-ruin probability in the classical insurance model. II. (Russian)
Prykl. Stat., Aktuarna Finans. Mat. 2011, No. 1-2, 168-183 (2011).
14
The simplex and policy-iteration methods are strongly polynomial for the Markov decision problem with a fixed discount rate. (English)
Math. Oper. Res. 36, No. 4, 593-603 (2011).
15
Geometric rounding: A dependent randomized rounding scheme. (English)
J. Comb. Optim. 22, No. 4, 699-725 (2011).
16
An OTP-based mechanism for defending application layer ddos attacks. (English)
Zhang, Jun (ed.), Applied informatics and communication. International conference, ICAIC 2011, Xi’an, China, August 20‒21, 2011, Proceedings, Part IV. Berlin: Springer (ISBN 978-3-642-23225-1/pbk; 978-3-642-23226-8/ebook). Communications in Computer and Information Science 227, 388-396 (2011).
17
ELM-based time-variant neural networks with incremental number of output basis functions. (English)
Liu, Derong (ed.) et al., Advances in neural networks ‒ ISNN 2011. 8th international symposium on neural networks, ISNN 2011, Guilin, China, May 29 ‒ June 1, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-21104-1/pbk). Lecture Notes in Computer Science 6675, 403-410 (2011).
18
Syntactic complexity of prefix-, suffix-, and bifix-free regular languages. (English)
Holzer, Markus (ed.) et al., Descriptional complexity of formal systems. 13th international workshop, DCFS 2011, Gießen/Limburg, Germany, July 25‒27, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22599-4/pbk). Lecture Notes in Computer Science 6808, 93-106 (2011).
19
Syntactic complexity of ideal and closed languages. (English)
Mauri, Giancarlo (ed.) et al., Developments in language theory. 15th international conference, DLT 2011, Milan, Italy, July 19‒22, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22320-4/pbk). Lecture Notes in Computer Science 6795, 117-128 (2011).
20
Result 1 to 20 of 748 total
Start
Contact
Print
General Help
