Sciweavers

2600 search results - page 23 / 520
» Clustering with or without the Approximation
Sort
View
CORR
1999
Springer
222views Education» more  CORR 1999»
13 years 7 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
PKDD
2007
Springer
102views Data Mining» more  PKDD 2007»
14 years 1 months ago
Towards Data Mining Without Information on Knowledge Structure
Most knowledge discovery processes are biased since some part of the knowledge structure must be given before extraction. We propose a framework that avoids this bias by supporting...
Alexandre Vautier, Marie-Odile Cordier, Rene Quini...
CCGRID
2005
IEEE
14 years 1 months ago
Implementing MPI-IO atomic mode without file system support
The ROMIO implementation of the MPI-IO standard provides a portable infrastructure for use on top of any number of different underlying storage targets. These different targets va...
Robert B. Ross, Robert Latham, William Gropp, Raje...
SMA
2009
ACM
133views Solid Modeling» more  SMA 2009»
14 years 2 months ago
Mesh clustering by approximating centroidal Voronoi tessellation
Fengtao Fan, Fuhua (Frank) Cheng, Conglin Huang, Y...
FOCS
2008
IEEE
14 years 2 months ago
Approximate Kernel Clustering
Subhash Khot, Assaf Naor