Sciweavers

1403 search results - page 123 / 281
» Set cover algorithms for very large datasets
Sort
View
CIVR
2006
Springer
219views Image Analysis» more  CIVR 2006»
15 years 8 months ago
Bayesian Learning of Hierarchical Multinomial Mixture Models of Concepts for Automatic Image Annotation
We propose a novel Bayesian learning framework of hierarchical mixture model by incorporating prior hierarchical knowledge into concept representations of multi-level concept struc...
Rui Shi, Tat-Seng Chua, Chin-Hui Lee, Sheng Gao
EUROCOLT
1999
Springer
15 years 8 months ago
Regularized Principal Manifolds
Many settings of unsupervised learning can be viewed as quantization problems — the minimization of the expected quantization error subject to some restrictions. This allows the ...
Alex J. Smola, Robert C. Williamson, Sebastian Mik...
BMCBI
2004
112views more  BMCBI 2004»
15 years 4 months ago
A double classification tree search algorithm for index SNP selection
Background: In population-based studies, it is generally recognized that single nucleotide polymorphism (SNP) markers are not independent. Rather, they are carried by haplotypes, ...
Peisen Zhang, Huitao Sheng, Ryuhei Uehara
GIS
2007
ACM
16 years 5 months ago
Dynamic storage balancing in a distributed spatial index
We propose a general framework to index very large datasets of spatial data in a distributed system. Our proposal is built on the recently proposed Scalable Distributed Rtree (SD-...
Cédric du Mouza, Philippe Rigaux, Witold Li...
246
Voted
CVPR
2010
IEEE
16 years 1 months ago
Aggregating local descriptors into a compact image representation
We address the problem of image search on a very large scale, where three constraints have to be considered jointly: the accuracy of the search, its efficiency, and the memory usag...
Hervé Jégou, Matthijs Douze, Cordelia Schmid and...