Result 1 to 20 of 1260 total
Watermark embedding using audio fingerprinting. (English)
Shi, Yun Q. (ed.) et al., Transactions on data hiding and multimedia security VIII. Special issue on pattern recognition for IT security. Berlin: Springer (ISBN 978-3-642-31970-9/pbk). Lecture Notes in Computer Science 7228. Journal Subline, 63-79 (2012).
1
On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities. (English)
Inf. Process. Lett. 112, No. 23, 903-907 (2012).
2
Using explicit platform descriptions to support programming of heterogeneous many-core systems. (English)
Parallel Comput. 38, No. 1-2, 52-65 (2012).
3
Finding vertex-surjective graph homomorphisms. (English)
Acta Inf. 49, No. 6, 381-394 (2012).
4
On online labeling with polynomially many labels. (English)
Epstein, Leah (ed.) et al., Algorithms ‒ ESA 2012. 20th annual European symposium, Ljubljana, Slovenia, September 10‒12, 2012. Proceeding. Berlin: Springer (ISBN 978-3-642-33089-6/pbk). Lecture Notes in Computer Science 7501, 121-132 (2012).
5
On the distribution of linear biases: three instructive examples. (English)
Safavi-Naini, Reihaneh (ed.) et al., Advances in cryptology ‒ CRYPTO 2012. 32nd annual cryptology conference, Santa Barbara, CA, USA, August 19‒23, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32008-8/pbk). Lecture Notes in Computer Science 7417, 50-67 (2012).
6
On the scope of the universal-algebraic approach to constraint satisfaction. (English)
Log. Methods Comput. Sci. 8, No. 3, Paper No. 13, 30 p., electronic only (2012).
7
A symbolic approach to generation and analysis of finite difference schemes of partial differential equations. (English)
Langer, Ulrich (ed.) et al., Numerical and symbolic scientific computing. Progress and prospects. New York, NY: Springer (ISBN 978-3-7091-0793-5/pbk; 978-3-7091-0794-2/ebook). Texts \& Monographs in Symbolic Computation, 123-156 (2012).
8
Constraint satisfaction with counting quantifiers. (English)
Hirsch, Edward A. (ed.) et al., Computer science ‒ theory and applications. 7th international computer science symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3‒7, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30641-9/pbk). Lecture Notes in Computer Science 7353, 253-265 (2012).
9
Finding vertex-surjective graph homomorphisms. (English)
Hirsch, Edward A. (ed.) et al., Computer science ‒ theory and applications. 7th international computer science symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3‒7, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30641-9/pbk). Lecture Notes in Computer Science 7353, 160-171 (2012).
10
On the Laplacian and signless Laplacian spectrum of a graph with $k$ pairwise co-neighbor vertices. (English)
Linear Algebra Appl. 437, No. 9, 2308-2316 (2012).
11
The complexity of surjective homomorphism problems-a survey. (English)
Discrete Appl. Math. 160, No. 12, 1680-1690 (2012).
12
Computational complexity of avalanches in the Kadanoff sandpile model. (English)
Fundam. Inform. 115, No. 1, 107-124 (2012).
13
Selecting against antibiotic-resistant pathogens: optimal treatments in the presence of commensal bacteria. (English)
Bull. Math. Biol. 74, No. 4, 908-934 (2012).
14
An analytic research on secondary-spectrum trading mechanisms based on technical and market changes. (English)
Comput. Netw. 56, No. 1, 3-19 (2012).
15
The limits of tractability in resolution-based propositional proof systems. (English)
Ann. Pure Appl. Logic 163, No. 6, 656-668 (2012).
16
Three-dimensional event visualization for the ATLAS calorimeter (English)
Computer Physics Communications 183, No. 2, 245-250 (2012).
17
Synergy or separation mode: the relationship between the Academic research and the knowledge-transfer activities of korean academics (English)
Scientometrics 90, No. 1, 177-200 (2012).
18
Parameterized proof complexity. (English)
Comput. Complexity 20, No. 1, 51-85 (2011).
19
Minimizing synchronization in $\text {IDR}(s)$. (English)
Numer. Linear Algebra Appl. 18, No. 5, 805-825 (2011).
20
Result 1 to 20 of 1260 total
Start
Contact
Print
General Help
