Sciweavers

1717 search results - page 129 / 344
» A Computable Spectral Theorem
Sort
View
191
Voted
ECCV
2010
Springer
15 years 9 months ago
Fast Approximate Nearest Neighbor Methods for Non-Euclidean Manifolds with Applications to Human Activity Analysis in Videos
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
Rizwan Chaudhry, Yuri Ivanov
156
Voted
SIGGRAPH
1996
ACM
15 years 8 months ago
Consequences of Stratified Sampling in Graphics
Antialiased pixel values are often computed as the mean of N point samples. Using uniformly distributed random samples, the central limit theorem predicts a variance of the mean o...
Don P. Mitchell
FOCS
1991
IEEE
15 years 8 months ago
Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
Anna Gál
ICCV
2009
IEEE
16 years 9 months ago
Is Dual Linear Self-Calibration Artificially Ambiguous?
This purely theoretical work investigates the problem of artificial singularities in camera self-calibration. Selfcalibration allows one to upgrade a projective reconstruction t...
Pierre Gurdjos, Adrien Bartoli, Peter Sturm
STOC
2004
ACM
117views Algorithms» more  STOC 2004»
16 years 4 months ago
New notions of security: achieving universal composability without trusted setup
We propose a modification to the framework of Universally Composable (UC) security [3]. Our new notion, involves comparing the protocol executions with an ideal execution involvin...
Manoj Prabhakaran, Amit Sahai