Sciweavers

1717 search results - page 325 / 344
» A Computable Spectral Theorem
Sort
View
129
Voted
ICCV
2003
IEEE
16 years 2 months ago
Appearance Sampling for Obtaining A Set of Basis Images for Variable Illumination
Previous studies have demonstrated that the appearance of an object under varying illumination conditions can be represented by a low-dimensional linear subspace. A set of basis i...
Imari Sato, Takahiro Okabe, Yoichi Sato, Katsushi ...
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
16 years 1 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
16 years 22 days ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
DCC
2006
IEEE
16 years 5 hour ago
The B-coder: An Improved Binary Arithmetic Coder and Probability Estimator
In this paper we present the B-coder, an efficient binary arithmetic coder that performs extremely well on a wide range of data. The B-coder should be classed as an `approximate&#...
Benjamin Kelly, David F. Brailsford
95
Voted
SOFSEM
2009
Springer
15 years 9 months ago
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
Martin Dietzfelbinger, Ulf Schellbach