Sciweavers

3020 search results - page 409 / 604
» Optimal partition trees
Sort
View
VLDB
2005
ACM
85views Database» more  VLDB 2005»
15 years 12 months ago
Inspector Joins
The key idea behind Inspector Joins is that during the I/O partitioning phase of a hash-based join, we have the opportunity to look at the actual data itself and then use this kno...
Shimin Chen, Anastassia Ailamaki, Phillip B. Gibbo...
APWEB
2005
Springer
15 years 12 months ago
Summarizing Spatial Relations - A Hybrid Histogram
Summarizing topological relations is fundamental to many spatial applications including spatial query optimization. In this paper, we examine the selectivity estimation for range w...
Qing Liu, Xuemin Lin, Yidong Yuan
DAGM
2004
Springer
15 years 12 months ago
Adaptive Feature Selection in Image Segmentation
Most image segmentation algorithms optimize some mathematical similarity criterion derived from several low-level image features. One possible way of combining different types of f...
Volker Roth, Tilman Lange
ESA
2004
Springer
166views Algorithms» more  ESA 2004»
15 years 12 months ago
Super Scalar Sample Sort
Sample sort, a generalization of quicksort that partitions the input into many pieces, is known as the best practical comparison based sorting algorithm for distributed memory para...
Peter Sanders, Sebastian Winkel
GECCO
2003
Springer
322views Optimization» more  GECCO 2003»
15 years 11 months ago
AntClust: Ant Clustering and Web Usage Mining
Abstract. In this paper, we propose a new ant-based clustering algorithm called AntClust. It is inspired from the chemical recognition system of ants. In this system, the continuou...
Nicolas Labroche, Nicolas Monmarché, Gilles...