Sciweavers

599 search results - page 29 / 120
» The repeater tree construction problem
Sort
View
CCECE
2006
IEEE
15 years 3 months ago
New Constraints on Generation of Uniform Random Samples from Evolutionary Trees
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
Anupam Bhattacharjee, Zalia Shams, Kazi Zakia Sult...
WG
2007
Springer
15 years 3 months ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...
93
Voted
FSTTCS
1998
Springer
15 years 1 months ago
Optimal Regular Tree Pattern Matching Using Pushdown Automata
Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a ...
Maya Madhavan, Priti Shankar
JUCS
2000
117views more  JUCS 2000»
14 years 9 months ago
The Light Control Case Study: Problem Description
: This document contains a range of needs and requirements concerning the construction of a light control system for a floor of a university building. A description of the building...
Stefan Queins, Gerhard Zimmermann, Martin Becker, ...
WISE
2007
Springer
15 years 3 months ago
On Tree Pattern Query Rewriting Using Views
We study and present our findings on two closely related problems on xpath rewriting using views when both the view and the query are tree patterns involving /,// and []. First, g...
Junhu Wang, Jeffrey Xu Yu, Chengfei Liu