Sciweavers

664 search results - page 62 / 133
» An objective way to evaluate and compare binarization algori...
Sort
View
120
Voted
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
16 years 28 days ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
TOG
2008
145views more  TOG 2008»
15 years 13 days ago
Real-time KD-tree construction on graphics hardware
We present an algorithm for constructing kd-trees on GPUs. This algorithm achieves real-time performance by exploiting the GPU's streaming architecture at all stages of kd-tr...
Kun Zhou, Qiming Hou, Rui Wang 0004, Baining Guo
GIS
2004
ACM
16 years 1 months ago
A novel improvement to the R*-tree spatial index using gain/loss metrics
The R*-tree is a state-of-the-art spatial index structure. It has already found its way into commercial systems. The most important improvement of the R*-tree over the original R-...
Donghui Zhang, Tian Xia
ACIVS
2006
Springer
15 years 4 months ago
Robust Analysis of Silhouettes by Morphological Size Distributions
We address the topic of real-time analysis and recognition of silhouettes. The method that we propose first produces object features obtained by a new type of morphological operato...
Olivier Barnich, Sébastien Jodogne, Marc Va...
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
16 years 20 days ago
Efficient Processing of Joins on Set-valued Attributes
Object-oriented and object-relational DBMS support setvalued attributes, which are a natural and concise way to model complex information. However, there has been limited research...
Nikos Mamoulis