Sciweavers

313 search results - page 46 / 63
» Consistent Approximations and Approximate Functions and Grad...
Sort
View
INFOCOM
2006
IEEE
14 years 2 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
CORR
2010
Springer
204views Education» more  CORR 2010»
13 years 7 months ago
Predictive State Temporal Difference Learning
We propose a new approach to value function approximation which combines linear temporal difference reinforcement learning with subspace identification. In practical applications...
Byron Boots, Geoffrey J. Gordon
SIBGRAPI
2007
IEEE
14 years 3 months ago
Graph-based Object Tracking Using Structural Pattern Recognition
This paper proposes a model-based methodology for recognizing and tracking objects in digital image sequences. Objects are represented by attributed relational graphs (or ARGs), w...
Ana Beatriz V. Graciano, Roberto Marcondes Cesar J...
ICALP
2009
Springer
14 years 9 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
13 years 7 months ago
Scalable similarity search with optimized kernel hashing
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
Junfeng He, Wei Liu, Shih-Fu Chang