Sciweavers

166 search results - page 21 / 34
» Resultants of partially composed polynomials
Sort
View
CRYPTO
2005
Springer
96views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
Privacy-Preserving Set Operations
In many important applications, a collection of mutually distrustful parties must perform private computation over multisets. Each party’s input to the function is his private i...
Lea Kissner, Dawn Xiaodong Song
CCIA
2009
Springer
13 years 8 months ago
Seeking Acronym Definitions: a Web-based Approach
Acronyms are widely used in many domains to abbreviate and stress important concepts. Due to its dynamicity and unbounded nature, manual attempts to compose a global scale reposito...
David Sánchez, David Isern
COCO
2004
Springer
185views Algorithms» more  COCO 2004»
13 years 11 months ago
Limitations of Quantum Advice and One-Way Communication
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Scott Aaronson
CORR
2002
Springer
166views Education» more  CORR 2002»
13 years 7 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck
CVPR
2007
IEEE
14 years 9 months ago
P3 & Beyond: Solving Energies with Higher Order Cliques
In this paper we extend the class of energy functions for which the optimal -expansion and -swap moves can be computed in polynomial time. Specifically, we introduce a class of hi...
Pushmeet Kohli, M. Pawan Kumar, Philip H. S. Torr