Sciweavers

495 search results - page 29 / 99
» Probability Trees
Sort
View
EDBT
2006
ACM
130views Database» more  EDBT 2006»
14 years 8 months ago
Querying and Updating Probabilistic Information in XML
Abstract. We present in this paper a new model for representing probabilistic information in a semi-structured (XML) database, based on the use of probabilistic event variables. Th...
Serge Abiteboul, Pierre Senellart
ACL
2010
13 years 6 months ago
Tree-Based Deterministic Dependency Parsing - An Application to Nivre's Method -
Nivre's method was improved by enhancing deterministic dependency parsing through application of a tree-based model. The model considers all words necessary for selection of ...
Kotaro Kitagawa, Kumiko Tanaka-Ishii
ICRA
2007
IEEE
144views Robotics» more  ICRA 2007»
14 years 2 months ago
Particle RRT for Path Planning with Uncertainty
— This paper describes a new extension to the Rapidly–exploring Random Tree (RRT) path planning algorithm. The Particle RRT algorithm explicitly considers uncertainty in its do...
Nik A. Melchior, Reid G. Simmons
RECOMB
2006
Springer
14 years 9 months ago
Maximal Accurate Forests from Distance Matrices
Abstract. We present a fast converging method for distance-based phylogenetic inference, which is novel in two respects. First, it is the only method (to our knowledge) to guarante...
Constantinos Daskalakis, Cameron Hill, Alexander J...
STOC
2010
ACM
261views Algorithms» more  STOC 2010»
14 years 1 months ago
An Improved LP-based Approximation for Steiner Tree
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss...