Sciweavers

6365 search results - page 131 / 1273
» Fast Local Computation Algorithms
Sort
View
CSR
2010
Springer
15 years 9 months ago
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
Uwe Schöning
PODC
2010
ACM
15 years 8 months ago
Brief announcement: exponential speed-up of local algorithms using non-local communication
We demonstrate how to leverage a system’s capability for allto-all communication to achieve an exponential speed-up of local algorithms despite bandwidth and memory restrictions...
Christoph Lenzen, Roger Wattenhofer
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
16 years 5 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
IJON
2006
169views more  IJON 2006»
15 years 4 months ago
Denoising using local projective subspace methods
In this paper we present denoising algorithms for enhancing noisy signals based on Local ICA (LICA), Delayed AMUSE (dAMUSE) and Kernel PCA (KPCA). The algorithm LICA relies on app...
Peter Gruber, Kurt Stadlthanner, Matthias Böh...
PPL
2010
117views more  PPL 2010»
14 years 11 months ago
Neighborhood Structures for GPU-Based Local Search Algorithms
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...