Sciweavers

601 search results - page 115 / 121
» Measurable sets with excluded distances
Sort
View
CVPR
2000
IEEE
14 years 10 months ago
Improving Visual Matching
Many visual matching algorithms can be described in terms of the features and the inter-feature distance or metric. The most commonly used metric is the sum of squared di erences ...
Michael S. Lew, Nicu Sebe, Thomas S. Huang
KDD
2008
ACM
119views Data Mining» more  KDD 2008»
14 years 9 months ago
SAIL: summation-based incremental learning for information-theoretic clustering
Information-theoretic clustering aims to exploit information theoretic measures as the clustering criteria. A common practice on this topic is so-called INFO-K-means, which perfor...
Junjie Wu, Hui Xiong, Jian Chen
PERCOM
2008
ACM
14 years 8 months ago
ReMo : An Energy Efficient Reprogramming Protocol for Mobile Sensor Networks
Existing code update protocols for reprogramming nodes in a sensor network are either unsuitable or inefficient when used in a mobile environment. The prohibitive factor of uncert...
Pradip De, Yonghe Liu, Sajal K. Das
ISBRA
2009
Springer
14 years 3 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...
DIS
2007
Springer
14 years 2 months ago
A Hilbert Space Embedding for Distributions
We describe a technique for comparing distributions without the need for density estimation as an intermediate step. Our approach relies on mapping the distributions into a reprodu...
Alexander J. Smola, Arthur Gretton, Le Song, Bernh...