Sciweavers

1888 search results - page 169 / 378
» Information Distance
Sort
View
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 8 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
15 years 8 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
MM
2010
ACM
191views Multimedia» more  MM 2010»
15 years 2 months ago
Quantifying tag representativeness of visual content of social images
Social tags describe images from many aspects including the visual content observable from the images, the context and usage of images, user opinions and others. Not all tags are ...
Aixin Sun, Sourav S. Bhowmick
CVPR
2012
IEEE
13 years 7 months ago
Supervised hashing with kernels
Recent years have witnessed the growing popularity of hashing in large-scale vision problems. It has been shown that the hashing quality could be boosted by leveraging supervised ...
Wei Liu, Jun Wang, Rongrong Ji, Yu-Gang Jiang, Shi...
CVPR
2005
IEEE
16 years 7 months ago
Simultaneous Modeling and Tracking (SMAT) of Feature Sets
A novel method for the simultaneous modeling and tracking (SMAT) of a feature set during motion sequence is proposed. The method requires no prior information. Instead the a poste...
N. D. H. Dowson, Richard Bowden