Sciweavers

720 search results - page 47 / 144
» Linear k-arboricities on trees
Sort
View
NJC
2006
102views more  NJC 2006»
13 years 8 months ago
Online Evaluation of Regular Tree Queries
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
Alexandru Berlea
DAM
2000
126views more  DAM 2000»
13 years 8 months ago
2-Medians in trees with pos/neg weights
This paper deals with facility location problems with pos=neg weights in trees. We consider two di erent objective functions which model two di erent ways to handle obnoxious faci...
Rainer E. Burkard, Eranda Çela, Helidon Dol...
ALGORITHMICA
2011
13 years 3 months ago
An Approximation Algorithm for Binary Searching in Trees
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
Eduardo Sany Laber, Marco Molinaro
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
14 years 10 months ago
The Haar+ Tree: A Refined Synopsis Data Structure
We introduce the Haar+ tree: a refined, wavelet-inspired data structure for synopsis construction. The advantages of this structure are twofold: First, it achieves higher synopsis...
Panagiotis Karras, Nikos Mamoulis
ICRA
2005
IEEE
121views Robotics» more  ICRA 2005»
14 years 2 months ago
Distributed Sampling-Based Roadmap of Trees for Large-Scale Motion Planning
Abstract— High-dimensional problems arising from complex robotic systems test the limits of current motion planners and require the development of efficient distributed motion p...
Erion Plaku, Lydia E. Kavraki