Sciweavers

685 search results - page 41 / 137
» Succinct Trees in Practice
Sort
View
ICDT
2007
ACM
105views Database» more  ICDT 2007»
13 years 11 months ago
Unlocking Keys for XML Trees
Abstract. We review key constraints in the context of XML as introduced by Buneman et al. We show that one of the proposed inference rules is not sound in general, and the axiomati...
Sven Hartmann, Sebastian Link
AINA
2008
IEEE
13 years 9 months ago
An Efficient Tree Structure for Delay Sensitive Data Gathering in Wireless Sensor Networks
It is important to design an energy efficient data gathering tree structure for wireless sensor networks. As for the energy efficiency, network's overall energy consumption an...
Soonmok Kwon, Jeonggyu Kim, Cheeha Kim
PLANX
2007
13 years 9 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...
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 9 months ago
Fast and reliable reconstruction of phylogenetic trees with very short edges
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
Ilan Gronau, Shlomo Moran, Sagi Snir
ICRA
2008
IEEE
135views Robotics» more  ICRA 2008»
14 years 2 months ago
Path and trajectory diversity: Theory and algorithms
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
Michael S. Branicky, Ross A. Knepper, James J. Kuf...