Sciweavers

308 search results - page 30 / 62
» How Fast Is the k-Means Method
Sort
View
106
Voted
ICDM
2005
IEEE
148views Data Mining» more  ICDM 2005»
15 years 9 months ago
Online Hierarchical Clustering in a Data Warehouse Environment
Many important industrial applications rely on data mining methods to uncover patterns and trends in large data warehouse environments. Since a data warehouse is typically updated...
Elke Achtert, Christian Böhm, Hans-Peter Krie...
ICCV
2009
IEEE
1022views Computer Vision» more  ICCV 2009»
16 years 8 months ago
Kernelized Locality-Sensitive Hashing for Scalable Image Search
Fast retrieval methods are critical for large-scale and data-driven vision applications. Recent work has explored ways to embed high-dimensional features or complex distance fun...
Brian Kulis, Kristen Grauman
123
Voted
AROBOTS
2000
137views more  AROBOTS 2000»
15 years 3 months ago
Acquiring Mobile Robot Behaviors by Learning Trajectory Velocities
Abstract. The development of robots that learn from experience is a relentless challenge confronting artificial intelligence today. This paper describes a robot learning method whi...
Koren Ward, Alexander Zelinsky
149
Voted
ICPR
2006
IEEE
15 years 9 months ago
Multiscale Feature Extraction of Finger-Vein Patterns Based on Curvelets and Local Interconnection Structure Neural Network
In this paper, we originally propose a multiscale feature extraction method of finger-vein patterns based on curvelets and local interconnection structure neural networks. The cur...
Zhongbo Zhang, Siliang Ma, Xiao Han
141
Voted
SIGMOD
2010
ACM
208views Database» more  SIGMOD 2010»
15 years 3 months ago
Hierarchically organized skew-tolerant histograms for geographic data objects
Histograms have been widely used for fast estimation of query result sizes in query optimization. In this paper, we propose a new histogram method, called the Skew-Tolerant Histog...
Yohan J. Roh, Jae Ho Kim, Yon Dohn Chung, Jin Hyun...