1594 search results - page 57 / 319 » Fast Prediction on a Tree |
WEA
2007
Springer
14 years 2 months ago
2007
Springer
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
ARCS
2006
Springer
13 years 11 months ago
2006
Springer
An n-node tree has to be explored by a group of k mobile robots deployed initially at the root. Robots traverse the edges of the tree until all nodes are visited. We would like to ...
SIAMSC
2010
13 years 2 months ago
2010
In this paper, we outline two improvements to the fast sweeping method to improve the speed of the method in general and more specifically in cases where the speed is changing rapi...
TCAD
2010
13 years 2 months ago
2010
In this paper, we present DeFer--a fast, high-quality, scalable, and nonstochastic fixed-outline floorplanning algorithm. DeFer generates a nonslicing floorplan by compacting a sli...
ACL
2011
12 years 11 months ago
2011
We introduce synchronous tree adjoining grammars (TAG) into tree-to-string translation, which converts a source tree to a target string. Without reconstructing TAG derivations exp...