Sciweavers

419 search results - page 32 / 84
» First Order Paths in Ordered Trees
Sort
View
PLANX
2007
13 years 11 months ago
XPath Typing Using a Modal Logic with Converse for Finite Trees
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
Pierre Genevès, Nabil Layaïda, Alan Sc...
JNW
2008
115views more  JNW 2008»
13 years 9 months ago
On the Interaction Between Multiple Paths and Wireless Mesh Networks Scheduler Approaches
Multi-path routing allows building and use of multiple paths for routing between a source-destination pair. This paper investigates the problem of selecting multiple routing paths ...
Valeria Loscrì
MOBIHOC
2004
ACM
14 years 9 months ago
Using labeled paths for loop-free on-demand routing in ad hoc networks
We present the Feasible Label Routing (FLR) protocol for mobile ad hoc networks, which uses path information to establish routes to destinations on demand. FLR enables loopfree in...
Hari Rangarajan, J. J. Garcia-Luna-Aceves
MM
2010
ACM
167views Multimedia» more  MM 2010»
13 years 10 months ago
Improving online gaming quality using detour paths
We study the problem of improving the user perceived quality of online games in which multiple players form a game session and exchange game-state updates over an overlay network....
Cong Ly, Cheng-Hsin Hsu, Mohamed Hefeeda
ACL
2004
13 years 11 months ago
Deep Dependencies from Context-Free Statistical Parsers: Correcting the Surface Dependency Approximation
We present a linguistically-motivated algorithm for reconstructing nonlocal dependency in broad-coverage context-free parse trees derived from treebanks. We use an algorithm based...
Roger Levy, Christopher D. Manning