Sciweavers

1539 search results - page 7 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 7 months ago
Fast Density Codes for Image Data
Recently, a new method for encoding data sets in the form of "Density Codes" was proposed in the literature (Courrieu, 2006). This method allows to compare sets of points...
Pierre Courrieu
ENVSOFT
2000
86views more  ENVSOFT 2000»
13 years 7 months ago
Broken line smoothing: a simple method for interpolating and smoothing data series
A technique is proposed for smoothing a broken line fit, with known break points, to observational data. It will be referred to as "broken line smoothing". The smoothness...
Demetris Koutsoyiannis
ECAI
2010
Springer
13 years 8 months ago
A Very Fast Method for Clustering Big Text Datasets
Large-scale text datasets have long eluded a family of particularly elegant and effective clustering methods that exploits the power of pair-wise similarities between data points ...
Frank Lin, William W. Cohen
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
13 years 7 months ago
How Fast Is the k-Means Method?
We present polynomial upper and lower bounds on the number of iterations performed by the k-means method (a.k.a. Lloyd's method) for k-means clustering. Our upper bounds are ...
Sariel Har-Peled, Bardia Sadri
VMV
2008
164views Visualization» more  VMV 2008»
13 years 9 months ago
Vector Glyphs for Surfaces: A Fast and Simple Glyph Placement Algorithm for Adaptive Resolution Meshes
Visualization of flow on boundary surfaces from computational flow dynamics (CFD) is challenging due to the complex, adaptive resolution nature of the meshes used in the modeling ...
Zhenmin Peng, Robert S. Laramee