Sciweavers

2487 search results - page 432 / 498
» Partitions of Graphs into Trees
Sort
View
149
Voted
VRST
2003
ACM
15 years 8 months ago
Time-critical collision detection using an average-case approach
We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection. We p...
Jan Klein, Gabriel Zachmann
108
Voted
IPPS
1996
IEEE
15 years 7 months ago
A Parallel Solution to the Extended Set Union Problem with Unlimited Backtracking
In this paper, we study on the EREW-PRAM model a parallel solution to the extended set union problem with unlimited backtracking which maintains a dynamic partition of an n-elemen...
Maria Cristina Pinotti, Vincenzo A. Crupi, Sajal K...
172
Voted
BMCBI
2010
185views more  BMCBI 2010»
14 years 10 months ago
MetaPIGA v2.0: maximum likelihood large phylogeny estimation using the metapopulation genetic algorithm and other stochastic heu
Background: The development, in the last decade, of stochastic heuristics implemented in robust application softwares has made large phylogeny inference a key step in most compara...
Raphaël Helaers, Michel C. Milinkovitch
126
Voted
ICNP
2007
IEEE
15 years 10 months ago
HEXA: Compact Data Structures for Faster Packet Processing
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley...
150
Voted
NIPS
2007
15 years 5 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola