Sciweavers

6365 search results - page 98 / 1273
» Fast Local Computation Algorithms
Sort
View
IPPS
1999
IEEE
15 years 6 months ago
LLB: A Fast and Effective Scheduling Algorithm for Distributed-Memory Systems
This paper presents a new algorithm called List-based Load Balancing (LLB) for compile-time task scheduling on distributed-memory machines. LLB is intended as a cluster-mapping an...
Andrei Radulescu, Arjan J. C. van Gemund, Hai-Xian...
140
Voted
SGP
2004
15 years 5 months ago
Two Algorithms for Fast Reclustering of Dynamic Meshed Surfaces
Numerous mesh algorithms such as parametrization, radiosity, and collision detection require the decomposition of meshes into a series of clusters. In this paper we present two no...
Nathan A. Carr, John C. Hart
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
15 years 11 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
WG
2009
Springer
15 years 9 months ago
Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...
Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Dan...
193
Voted
TOG
2012
230views Communications» more  TOG 2012»
13 years 5 months ago
Decoupling algorithms from schedules for easy optimization of image processing pipelines
Using existing programming tools, writing high-performance image processing code requires sacrificing readability, portability, and modularity. We argue that this is a consequenc...
Jonathan Ragan-Kelley, Andrew Adams, Sylvain Paris...