Sciweavers

4865 search results - page 756 / 973
» The Complexity of Graph Connectivity
Sort
View
IEEEMSP
2002
IEEE
15 years 9 months ago
An optimal shape encoding scheme using skeleton decomposition
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
Haohong Wang, Guido M. Schuster, Aggelos K. Katsag...
PDP
2002
IEEE
15 years 9 months ago
The CDAG: A Data Structure for Automatic Parallelization for a Multithreaded Architecture
Despite the explosive new interest in Distributed Computing, bringing software — particularly legacy software — to parallel platforms remains a daunting task. The Self Distrib...
Bernd Klauer, Frank Eschmann, Ronald Moore, Klaus ...
GECCO
2009
Springer
159views Optimization» more  GECCO 2009»
15 years 9 months ago
Bayesian network structure learning using cooperative coevolution
We propose a cooperative-coevolution – Parisian trend – algorithm, IMPEA (Independence Model based Parisian EA), to the problem of Bayesian networks structure estimation. It i...
Olivier Barrière, Evelyne Lutton, Pierre-He...
ICRA
2000
IEEE
180views Robotics» more  ICRA 2000»
15 years 8 months ago
Interactive Motion Planning Using Hardware-Accelerated Computation of Generalized Voronoi Diagrams
We present techniques for fast motion planning by using discrete approximations of generalized Voronoi diagrams, computed with graphics hardware. Approaches based on this diagram ...
Kenneth E. Hoff III, Tim Culver, John Keyser, Ming...
CP
2000
Springer
15 years 8 months ago
Boosting Search with Variable Elimination
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
Javier Larrosa