Sciweavers

3934 search results - page 709 / 787
» A monothetic clustering method
Sort
View
96
Voted
COMPGEOM
2009
ACM
15 years 5 months 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
121
Voted
IWVF
2001
Springer
15 years 5 months ago
Color and Shape Index for Region-Based Image Retrieval
Abstract. Most CBIR systems use low-level visual features for representation and retrieval of images. Generally such methods suffer from the problems of high-dimensionality leadin...
B. G. Prasad, S. K. Gupta, K. K. Biswas
JAVA
2001
Springer
15 years 5 months ago
Supporting dynamic parallel object arrays
We present efficient support for generalized arrays of parallel data driven objects. Array elements are regular C++ objects, and are scattered across the parallel machine. An indi...
Orion Sky Lawlor, Laxmikant V. Kalé
FGR
2000
IEEE
159views Biometrics» more  FGR 2000»
15 years 5 months ago
Gesture Modeling and Recognition Using Finite State Machines
This paper proposes a state based approach to gesture learning and recognition. Using spatial clustering and temporal alignment, each gesture is defined to be an ordered sequence ...
Pengyu Hong, Thomas S. Huang, Matthew Turk
75
Voted
SC
2000
ACM
15 years 5 months ago
Parallel Algorithms for Radiation Transport on Unstructured Grids
The method of discrete ordinates is commonly used to solve the Boltzmann radiation transport equation for applications ranging from simulations of fires to weapons effects. The ...
Steve Plimpton, Bruce Hendrickson, Shawn Burns, Wi...