Sciweavers

1888 search results - page 69 / 378
» Information Distance
Sort
View
ENTCS
2008
102views more  ENTCS 2008»
13 years 8 months ago
A Monotonicity Principle for Information Theory
We establish a monotonicity principle for convex functions that enables high-level reasoning about capacity in information theory. Despite its simplicity, this single idea is rema...
Konstantinos Chatzikokolakis, Keye Martin
ICRA
2005
IEEE
114views Robotics» more  ICRA 2005»
14 years 2 months ago
A Proof for the Approximate Sparsity of SLAM Information Matrices
— For the Simultaneous Localization and Mapping problem several efficient algorithms have been proposed that make use of a sparse information matrix representation (e.g. SEIF, T...
Udo Frese
IGPL
2011
13 years 3 months ago
Existentially equivalent cyclic ultrametric spaces and cyclically valued groups
The notions of ultrametric distances and cyclic valuations appear when the set of values of the distance map is a cyclically ordered set. These structures can be described as subsp...
Gérard Leloup
MMS
2006
13 years 8 months ago
Evaluation and analysis of similarity measures for content-based visual information retrieval
The selection of appropriate proximity measures is one of the crucial success factors of content-based visual information retrieval. In this area of research, proximity measures ar...
Horst Eidenberger
ICDE
2001
IEEE
180views Database» more  ICDE 2001»
14 years 10 months ago
Distinctiveness-Sensitive Nearest Neighbor Search for Efficient Similarity Retrieval of Multimedia Information
Nearest neighbor (NN) search in high dimensional feature space is widely used for similarity retrieval of multimedia information. However, recent research results in the database ...
Norio Katayama, Shin'ichi Satoh