Sciweavers

3134 search results - page 258 / 627
» Computing full disjunctions
Sort
View
SPAA
1995
ACM
15 years 7 months ago
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias
128
Voted
PPOPP
1991
ACM
15 years 7 months ago
Dynamic Node Reconfiguration in a Parallel-Distributed Environment
Idle workstations in a network represent a significant computing potential. In particular, their processing power can be used by parallel-distributed programs that treat the netwo...
Michael J. Feeley, Brian N. Bershad, Jeffrey S. Ch...
131
Voted
GECCO
2009
Springer
148views Optimization» more  GECCO 2009»
15 years 6 months ago
Tracking multiple objects in non-stationary video
One of the key problems in computer vision and pattern recognition is tracking. Multiple objects, occlusion, and tracking moving objects using a moving camera are some of the chal...
Hoang Nguyen, Bir Bhanu
133
Voted
LATIN
2010
Springer
15 years 5 months ago
Lightweight Data Indexing and Compression in External Memory
In this paper we describe algorithms for computing the BWT and for building (compressed) indexes in external memory. The innovative feature of our algorithms is that they are light...
Paolo Ferragina, Travis Gagie, Giovanni Manzini
CEC
2005
IEEE
15 years 5 months ago
Co-evolutionary modular neural networks for automatic problem decomposition
Abstract- Decomposing a complex computational problem into sub-problems, which are computationally simpler to solve individually and which can be combined to produce a solution to ...
Vineet R. Khare, Xin Yao, Bernhard Sendhoff, Yaoch...