Sciweavers

13414 search results - page 260 / 2683
» The distributed boosting algorithm
Sort
View
FGCS
2000
145views more  FGCS 2000»
15 years 6 months ago
Ant algorithms and stigmergy
Ant colonies, and more generally social insect societies, are distributed systems that, in spite of the simplicity of their individuals, present a highly structured social organiz...
Marco Dorigo, Eric Bonabeau, Guy Theraulaz
ECCV
2004
Springer
16 years 9 months ago
Probabilistic Multi-view Correspondence in a Distributed Setting with No Central Server
Abstract. We present a probabilistic algorithm for finding correspondences across multiple images. The algorithm runs in a distributed setting, where each camera is attached to a s...
Shai Avidan, Yael Moses, Yoram Moses
185
Voted
SC
2003
ACM
16 years 9 days ago
ParADE: An OpenMP Programming Environment for SMP Cluster Systems
Demand for programming environments to exploit clusters of symmetric multiprocessors (SMPs) is increasing. In this paper, we present a new programming environment, called ParADE, ...
Yang-Suk Kee, Jin-Soo Kim, Soonhoi Ha
MICRO
1998
IEEE
98views Hardware» more  MICRO 1998»
15 years 11 months ago
Task Selection for a Multiscalar Processor
The Multiscalar architecture advocates a distributed processor organization and task-level speculation to exploit high degrees of instruction level parallelism (ILP) in sequential...
T. N. Vijaykumar, Gurindar S. Sohi
176
Voted
CORR
2008
Springer
133views Education» more  CORR 2008»
15 years 7 months ago
A simple local 3-approximation algorithm for vertex cover
We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxili...
Valentin Polishchuk, Jukka Suomela