Sciweavers

312 search results - page 51 / 63
» Indexing Gapped-Factors Using a Tree
Sort
View
AC
2000
Springer
14 years 2 months ago
Graph-Theoretical Methods in Computer Vision
The management of large databases of hierarchical (e.g., multi-scale or multilevel) image features is a common problem in object recognition. Such structures are often represented ...
Ali Shokoufandeh, Sven J. Dickinson
WALCOM
2007
IEEE
82views Algorithms» more  WALCOM 2007»
13 years 11 months ago
Methods for Searching Mutual Visible-Intervals on Moving Object
Abstract. Computing visible information, such as a visible surface determination, is a significant problem and has been mainly studied in the fields of computational geometry and...
Yoshiyuki Kusakari, Yuta Sugimoto, Junichi Notoya,...
SDM
2010
SIAM
181views Data Mining» more  SDM 2010»
13 years 11 months ago
Making k-means Even Faster
The k-means algorithm is widely used for clustering, compressing, and summarizing vector data. In this paper, we propose a new acceleration for exact k-means that gives the same a...
Greg Hamerly
MTA
2006
115views more  MTA 2006»
13 years 9 months ago
Tree-assisted gossiping for overlay video distribution
Given its readily deployable nature and broad applications for digital entertainment, video streaming through overlay networks has received much attention recently. While a tree to...
Jiangchuan Liu, Ming Zhou
ICDE
2007
IEEE
220views Database» more  ICDE 2007»
14 years 11 months ago
Structural Selectivity Estimation for XML Documents
Estimating the selectivity of queries is a crucial problem in database systems. Virtually all database systems rely on the use of selectivity estimates to choose amongst the many ...
Damien K. Fisher, Sebastian Maneth