Sciweavers

10146 search results - page 53 / 2030
» Fast FAST
Sort
View
DC
2006
13 years 10 months ago
Fast Paxos
Abstract. Paxos and Fast Paxos are optimal consensus algorithms that are simple and elegant, while suitable for efficient implementation. In this paper, we compare the performance ...
Leslie Lamport
ISMB
2001
13 years 11 months ago
Designing fast converging phylogenetic methods
Abstract: Absolute fast converging phylogenetic reconstruction methods are provably guaranteed to recover the true tree with high probability from sequences that grow only polynomi...
Luay Nakhleh, Usman Roshan, Katherine St. John, Je...
JAIR
2006
179views more  JAIR 2006»
13 years 10 months ago
The Fast Downward Planning System
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
Malte Helmert
CVPR
2005
IEEE
15 years 5 days ago
Mixture Trees for Modeling and Fast Conditional Sampling with Applications in Vision and Graphics
We introduce mixture trees, a tree-based data-structure for modeling joint probability densities using a greedy hierarchical density estimation scheme. We show that the mixture tr...
Frank Dellaert, Vivek Kwatra, Sang Min Oh
ICIP
2006
IEEE
14 years 11 months ago
Redundancy in All Pairs Fast Marching Method
In this paper, we analyze the redundancy in calculating all pairs of geodesic distances on a rectangular grid. Fast marching method is an efficient way to estimate the geodesic di...
Luca Bertelli, Baris Sumengen, B. S. Manjunath