Sciweavers

475 search results - page 73 / 95
» Efficient Set Similarity Joins Using Min-prefixes
Sort
View
SBBD
2008
256views Database» more  SBBD 2008»
13 years 9 months ago
Indexing Internal Memory with Minimal Perfect Hash Functions
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
Fabiano C. Botelho, Hendrickson R. Langbehn, Guilh...
3DOR
2010
13 years 2 months ago
Learning the Compositional Structure of Man-Made Objects for 3D Shape Retrieval
While approaches based on local features play a more and more important role for 3D shape retrieval, the problems of feature selection and similarity measurement between sets of l...
Raoul Wessel, Reinhard Klein
PR
2008
218views more  PR 2008»
13 years 7 months ago
Automatic feature localisation with constrained local models
We present an efficient and robust method of locating a set of feature points in an object of interest. From a training set we construct a joint model of the appearance of each fe...
David Cristinacce, Timothy F. Cootes
MM
2006
ACM
167views Multimedia» more  MM 2006»
14 years 1 months ago
Image annotation by large-scale content-based image retrieval
Image annotation has been an active research topic in recent years due to its potentially large impact on both image understanding and Web image search. In this paper, we target a...
Xirong Li, Le Chen, Lei Zhang, Fuzong Lin, Wei-Yin...
ICDE
2002
IEEE
204views Database» more  ICDE 2002»
14 years 8 months ago
Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
Sudipto Guha, Nick Koudas