Sciweavers

1086 search results - page 129 / 218
» Points surrounding the origin
Sort
View
100
Voted
COMPGEOM
2006
ACM
15 years 7 months ago
A fast k-means implementation using coresets
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
Gereon Frahling, Christian Sohler
CAD
2008
Springer
15 years 1 months ago
Structure-oriented contour representation and matching for engineering shapes
Conventional shape matching for engineering models primarily considers rigid shape similarity. They do not seek global shape similarity while considering large local deformations....
Suyu Hou, Karthik Ramani
PVLDB
2008
138views more  PVLDB 2008»
15 years 1 months ago
A skip-list approach for efficiently processing forecasting queries
Time series data is common in many settings including scientific and financial applications. In these applications, the amount of data is often very large. We seek to support pred...
Tingjian Ge, Stanley B. Zdonik
KDD
2002
ACM
183views Data Mining» more  KDD 2002»
16 years 1 months ago
E-CAST: A Data Mining Algorithm for Gene Expression Data
Data clustering methods have been proven to be a successful data mining technique in the analysis of gene expression data. The Cluster affinity search technique (CAST) developed b...
Abdelghani Bellaachia, David Portnoy, Yidong Chen,...
ICDE
2010
IEEE
251views Database» more  ICDE 2010»
16 years 1 months ago
Viewing a World of Annotations through AnnoVIP
The proliferation of electronic content has notably lead to the apparition of large corpora of interrelated structured documents (such as HTML and XML Web pages) and semantic annot...
Konstantinos Karanasos, Spyros Zoupanos