Sciweavers

335 search results - page 42 / 67
» High quality graph partitioning
Sort
View
ICDE
1999
IEEE
139views Database» more  ICDE 1999»
15 years 8 days ago
Clustering Large Datasets in Arbitrary Metric Spaces
Clustering partitions a collection of objects into groups called clusters, such that similar objects fall into the same group. Similarity between objects is defined by a distance ...
Venkatesh Ganti, Raghu Ramakrishnan, Johannes Gehr...
DATE
2005
IEEE
105views Hardware» more  DATE 2005»
14 years 4 months ago
An Improved Multi-Level Framework for Force-Directed Placement
One of the greatest impediments to achieving high quality placements using force-directed methods lies in the large amount of overlap initially present in these techniques. This o...
Kristofer Vorwerk, Andrew A. Kennings
NOSSDAV
2005
Springer
14 years 4 months ago
Supporting P2P gaming when players have heterogeneous resources
We present Ghost, a peer-to-peer game architecture that manages game consistency across a set of players with heterogeneous network resources. Ghost dynamically creates responsive...
Aaron St. John, Brian Neil Levine
IAJIT
2008
201views more  IAJIT 2008»
13 years 11 months ago
Implementation of a Novel Efficient Multiwavelet Based Video Coding Algorithm
: The recent explosion in digital video storage and delivery has presented strong motivation for high performance video compression solutions. An efficient video compression techni...
Sudhakar Radhakrishnan, Jayaraman Subramaniam
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
14 years 11 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis