Sciweavers

2110 search results - page 363 / 422
» What is the complexity of a distributed computing system
Sort
View
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
15 years 7 months ago
Parisian evolution with honeybees for three-dimensional reconstruction
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
Gustavo Olague, Cesar Puente
129
Voted
RECOMB
2000
Springer
15 years 7 months ago
Using Bayesian networks to analyze expression data
DNA hybridization arrays simultaneously measure the expression level for thousands of genes. These measurements provide a "snapshot" of transcription levels within the c...
Nir Friedman, Michal Linial, Iftach Nachman, Dana ...
CVPR
2010
IEEE
15 years 4 months ago
Scene understanding by statistical modeling of motion patterns
We present a novel method for the discovery and statistical representation of motion patterns in a scene observed by a static camera. Related methods involving learning of pattern...
Imran Saleemi, Lance Hartung, Mubarak Shah
CAD
2000
Springer
15 years 3 months ago
Managing digital libraries for computer-aided design
This paper describes our initial efforts to deploy a digital library to support computer-aided collaborative design. At present, this experimental testbed, The Engineering Design ...
William C. Regli, Vincent A. Cicirello
PPOPP
2010
ACM
16 years 1 months ago
Fast tridiagonal solvers on the GPU
We study the performance of three parallel algorithms and their hybrid variants for solving tridiagonal linear systems on a GPU: cyclic reduction (CR), parallel cyclic reduction (...
Yao Zhang, Jonathan Cohen, John D. Owens