Sciweavers

691 search results - page 92 / 139
» Axiomatizing geometric constructions
Sort
View
ICDM
2005
IEEE
165views Data Mining» more  ICDM 2005»
14 years 1 months ago
Orthogonal Neighborhood Preserving Projections
— Orthogonal Neighborhood Preserving Projections (ONPP) is a linear dimensionality reduction technique which attempts to preserve both the intrinsic neighborhood geometry of the ...
Effrosini Kokiopoulou, Yousef Saad
GRAPHITE
2005
ACM
14 years 1 months ago
Adaptive T-spline surface fitting to z-map models
Surface fitting refers to the process of constructing a smooth representation for an object surface from a fairly large number of measured 3D data points. This paper presents an ...
Jianmin Zheng, Yimin Wang, Hock Soon Seah
COMPGEOM
2009
ACM
14 years 9 days ago
k-means requires exponentially many iterations even in the plane
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
Andrea Vattani
ISAAC
1998
Springer
72views Algorithms» more  ISAAC 1998»
13 years 12 months ago
Casting with Skewed Ejection Direction
Casting is a manufacturing process in which liquid is poured into a cast (mould) that has a cavity with the shape of the object to be manufactured. The liquid then hardens, after ...
Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong
IPPS
1997
IEEE
13 years 12 months ago
d-Dimensional Range Search on Multicomputers
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...
Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin...