Sciweavers

4536 search results - page 205 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
SDM
2007
SIAM
74views Data Mining» more  SDM 2007»
13 years 11 months ago
HACS: Heuristic Algorithm for Clustering Subsets
The term consideration set is used in marketing to refer to the set of items a customer thought about purchasing before making a choice. While consideration sets are not directly ...
Ding Yuan, W. Nick Street
ICPR
2010
IEEE
13 years 9 months ago
Improved Mean Shift Algorithm with Heterogeneous Node Weights
The conventional mean shift algorithm has been known to be sensitive to selecting a bandwidth. We present a robust mean shift algorithm with heterogeneous node weights that come f...
Ji Won Yoon, Simon P. Wilson
PR
2006
132views more  PR 2006»
13 years 9 months ago
Some approaches to improve tree-based nearest neighbour search algorithms
Nearest neighbour search is a widely used technique in pattern recognition. During the last three decades a large number of fast algorithms have been proposed. In this work we are...
Eva Gómez-Ballester, Luisa Micó, Jos...
EGH
2009
Springer
13 years 7 months ago
Object partitioning considered harmful: space subdivision for BVHs
A major factor for the efficiency of ray tracing is the use of good acceleration structures. Recently, bounding volume hierarchies (BVHs) have become the preferred acceleration st...
Stefan Popov, Iliyan Georgiev, Rossen Dimov, Phili...
PKDD
2007
Springer
107views Data Mining» more  PKDD 2007»
14 years 3 months ago
An Empirical Comparison of Exact Nearest Neighbour Algorithms
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
Ashraf M. Kibriya, Eibe Frank