Sciweavers

2004 search results - page 373 / 401
» Sampling from large graphs
Sort
View
ECCV
2010
Springer
14 years 3 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
EUROCRYPT
2010
Springer
14 years 2 months ago
Universal One-Way Hash Functions via Inaccessible Entropy
This paper revisits the construction of Universal One-Way Hash Functions (UOWHFs) from any one-way function due to Rompel (STOC 1990). We give a simpler construction of UOWHFs, whi...
Iftach Haitner, Thomas Holenstein, Omer Reingold, ...
EDBT
2009
ACM
116views Database» more  EDBT 2009»
14 years 2 months ago
Ranking objects based on relationships and fixed associations
Text corpora are often enhanced by additional metadata which relate real-world entities, with each document in which such entities are discussed. Such relationships are typically ...
Albert Angel, Surajit Chaudhuri, Gautam Das, Nick ...
VISUALIZATION
1999
IEEE
14 years 2 months ago
Multi-Projector Displays Using Camera-Based Registration
Conventional projector-based display systems are typically designed around precise and regular configurations of projectors and display surfaces. While this results in rendering s...
Ramesh Raskar, Michael S. Brown, Ruigang Yang, Wei...
IWANN
1999
Springer
14 years 2 months ago
Using Temporal Neighborhoods to Adapt Function Approximators in Reinforcement Learning
To avoid the curse of dimensionality, function approximators are used in reinforcement learning to learn value functions for individual states. In order to make better use of comp...
R. Matthew Kretchmar, Charles W. Anderson