Sciweavers

6365 search results - page 259 / 1273
» Fast Local Computation Algorithms
Sort
View
AI
2008
Springer
15 years 6 months ago
Understanding the role of noise in stochastic local search: Analysis and experiments
Stochastic local search (SLS) algorithms have recently been proven to be among the best approaches to solving computationally hard problems. SLS algorithms typically have a number...
Ole J. Mengshoel
ALGOSENSORS
2006
Springer
15 years 8 months ago
Computing Bridges, Articulations, and 2-Connected Components in Wireless Sensor Networks
Abstract. This paper presents a simple distributed algorithm to determine the bridges, articulation points, and 2-connected components in asynchronous networks with an at least onc...
Volker Turau
ECAI
2004
Springer
15 years 10 months ago
Many Hands Make Light Work: Localized Satisfiability for Multi-Context Systems
In this paper, we tackle the satisfiability problem for multi-context systems. First, we establish a satisfiability algorithm based on an encoding into propositional logic. Then, w...
Floris Roelofsen, Luciano Serafini, Alessandro Cim...
ICIP
2002
IEEE
16 years 8 months ago
Full search content independent block matching based on the fast Fourier transform
In this paper, we present a new algorithm for solving the block matching problem which is independent of image content and is faster than other full-search methods. The method emp...
Mark S. Drew, Steven L. Kilthau, Torsten Möll...
DCC
2004
IEEE
16 years 6 months ago
Fast Near-Lossless or Lossless Compression of Large 3D Neuro-Anatomical Images
3D neuro-anatomical images and other volumetric data sets are important in many scientific and biomedical fields. Since such sets may be extremely large, a scalable compression me...
Rongkai Zhao, Michael Gabriel, Geneva G. Belford