Sciweavers

2899 search results - page 7 / 580
» Dynamic Trees in Practice
Sort
View
ACL
2006
13 years 9 months ago
Efficient Sentence Retrieval Based on Syntactic Structure
This paper proposes an efficient method of sentence retrieval based on syntactic structure. Collins proposed Tree Kernel to calculate structural similarity. However, structual ret...
Hiroshi Ichikawa, Keita Hakoda, Taiichi Hashimoto,...
FLAIRS
2001
13 years 9 months ago
A Practical Markov Chain Monte Carlo Approach to Decision Problems
Decisionand optimizationproblemsinvolvinggraphsarise in manyareas of artificial intelligence, including probabilistic networks, robot navigation, and network design. Manysuch prob...
Timothy Huang, Yuriy Nevmyvaka
TIME
2009
IEEE
14 years 2 months ago
Fixing the Semantics for Dynamic Controllability and Providing a More Practical Characterization of Dynamic Execution Strategies
Morris, Muscettola and Vidal (MMV) presented an algorithm for checking the dynamic controllability (DC) of temporal networks in which certain temporal durations are beyond the con...
Luke Hunsberger
SRDS
1998
IEEE
13 years 11 months ago
Practical Parallel Algorithms for Minimum Spanning Trees
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
Frank K. H. A. Dehne, Silvia Götz
ALENEX
2010
163views Algorithms» more  ALENEX 2010»
13 years 9 months ago
Succinct Trees in Practice
We implement and compare the major current techniques for representing general trees in succinct form. This is important because a general tree of n nodes is usually represented i...
Diego Arroyuelo, Rodrigo Cánovas, Gonzalo N...