Sciweavers

1285 search results - page 105 / 257
» On the Complexity of Ordinal Clustering
Sort
View
PDPTA
2004
13 years 11 months ago
Service Oriented Web Based Meta Resource Sharing Platform - The CBWeB Portal
Grid computing and cluster computing platforms are becoming the primary development platforms for pervasive computing. The primary problem associated with both computational grids...
Avinash Shankar, Daniel Saffioti, Ian Piper, Ashwi...
VLSISP
2010
191views more  VLSISP 2010»
13 years 4 months ago
Sign Language Phoneme Transcription with Rule-based Hand Trajectory Segmentation
A common approach to extract phonemes of sign language is to use an unsupervised clustering algorithm to group the sign segments. However, simple clustering algorithms based on dis...
W. W. Kong, Surendra Ranganath
COMPGEOM
2006
ACM
14 years 4 months ago
How slow is the k-means method?
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
David Arthur, Sergei Vassilvitskii
GI
2004
Springer
14 years 3 months ago
Crash Management for Distributed Parallel Systems
: With the growing complexity of parallel architectures, the probability of system failures grows, too. One approach to cope with this problem is the self-healing, one of the organ...
Jan Haase, Frank Eschmann
IJBRA
2008
69views more  IJBRA 2008»
13 years 10 months ago
A matrix-based multilevel approach to identify functional protein modules
: Identifying functional modules is believed to reveal most cellular processes. There have been many computational approaches to investigate the underlying biological structures [2...
Suely Oliveira, Sang-Cheol Seok