Sciweavers

559 search results - page 12 / 112
» Sketching Information Divergences
Sort
View
SIGIR
2008
ACM
14 years 11 months ago
Asymmetric distance estimation with sketches for similarity search in high-dimensional spaces
Efficient similarity search in high-dimensional spaces is important to content-based retrieval systems. Recent studies have shown that sketches can effectively approximate L1 dist...
Wei Dong, Moses Charikar, Kai Li
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 3 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
IJCNN
2006
IEEE
15 years 5 months ago
Information Theoretic Angle-Based Spectral Clustering: A Theoretical Analysis and an Algorithm
— Recent work has revealed a close connection between certain information theoretic divergence measures and properties of Mercer kernel feature spaces. Specifically, it has been...
Robert Jenssen, Deniz Erdogmus, Jose C. Principe
TIT
2010
158views Education» more  TIT 2010»
14 years 6 months ago
Belief propagation, Dykstra's algorithm, and iterated information projections
Belief propagation is shown to be an instance of a hybrid between two projection algorithms in the convex programming literature: Dykstra's algorithm with cyclic Bregman proje...
John MacLaren Walsh, Phillip A. Regalia
MKM
2009
Springer
15 years 4 months ago
Math-Literate Computers
Sketch recognizers are an important part of the design of natural interfaces for many domains. However, current recognition technology is generally quite crude and difficult to w...
Dorothea Blostein