Sciweavers

521 search results - page 43 / 105
» Coring method for clustering a graph
Sort
View
DATE
2002
IEEE
73views Hardware» more  DATE 2002»
15 years 9 months ago
A Burst-Mode Oriented Back-End for the Balsa Synthesis System
This paper introduces several new component clustering techniques for the optimization of asynchronous systems. In particular, novel “Burst-Mode aware” restrictions are impose...
Tiberiu Chelcea, Steven M. Nowick, Andrew Bardsley...
AUSAI
2006
Springer
15 years 8 months ago
DynamicWEB: Profile Correlation Using COBWEB
Establishing relationships within a dataset is one of the core objectives of data mining. In this paper a method of correlating behaviour profiles in a continuous dataset is presen...
Joel Scanlan, Jacky Hartnett, Raymond Williams
SIAMSC
2008
182views more  SIAMSC 2008»
15 years 4 months ago
A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
Pratik Biswas, Kim-Chuan Toh, Yinyu Ye
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
15 years 11 months ago
Redistricting Using Heuristic-Based Polygonal Clustering
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
Deepti Joshi, Leen-Kiat Soh, Ashok Samal
ACCV
2010
Springer
14 years 11 months ago
Earth Mover's Morphing: Topology-Free Shape Morphing Using Cluster-Based EMD Flows
Abstract. This paper describes a method for topology-free shape morphing based on region cluster-based Earth Mover's Distance (EMD) flows, since existing methods for closed cu...
Yasushi Makihara, Yasushi Yagi