Sciweavers

2600 search results - page 31 / 520
» Clustering with or without the Approximation
Sort
View
CGF
2004
127views more  CGF 2004»
13 years 7 months ago
Approximated Centroidal Voronoi Diagrams for Uniform Polygonal Mesh Coarsening
We present a novel clustering algorithm for polygonal meshes which approximates a Centroidal Voronoi Diagram construction. The clustering provides an efficient way to construct un...
Sébastien Valette, Jean-Marc Chassery
SIGIR
2006
ACM
14 years 1 months ago
Text clustering with extended user feedback
Text clustering is most commonly treated as a fully automated task without user feedback. However, a variety of researchers have explored mixed-initiative clustering methods which...
Yifen Huang, Tom M. Mitchell
ALENEX
2008
142views Algorithms» more  ALENEX 2008»
13 years 9 months ago
Consensus Clustering Algorithms: Comparison and Refinement
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
Andrey Goder, Vladimir Filkov
USENIX
2007
13 years 10 months ago
POTSHARDS: Secure Long-Term Storage Without Encryption
Users are storing ever-increasing amounts of information digitally, driven by many factors including government regulations and the public’s desire to digitally record their per...
Mark W. Storer, Kevin M. Greenan, Ethan L. Miller,...
GIS
2009
ACM
14 years 8 months ago
Sea Floor Bathymetry Trackline Surface Fitting Without Visible Artifacts Using ODETLAP
High quality, artifact-free fitting a bathymetry (sea-floor) surface to very unevenly spaced depth data from ship tracklines is possible with ODETLAP (Overdetermined Laplacian Par...
Tsz-Yam Lau, W. Randolph Franklin, You Li, Zhongyi...