Sciweavers

801 search results - page 22 / 161
» Minimal Locked Trees
Sort
View
AHSWN
2008
92views more  AHSWN 2008»
14 years 9 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
ALT
2003
Springer
15 years 1 months ago
Efficient Learning of Ordered and Unordered Tree Patterns with Contractible Variables
Due to the rapid growth of tree structured data such as Web documents, efficient learning from tree structured data becomes more and more important. In order to represent structura...
Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumot...
RECOMB
2009
Springer
15 years 10 months ago
New Perspectives on Gene Family Evolution: Losses in Reconciliation and a Link with Supertrees
Reconciliation between a set of gene trees and a species tree is the most commonly used approach to infer the duplication and loss events in the evolution of gene families, given a...
Cedric Chauve, Nadia El-Mabrouk
SODA
2004
ACM
156views Algorithms» more  SODA 2004»
14 years 11 months ago
Approximating Minimum Max-Stretch spanning Trees on unweighted graphs
Given a graph G and a spanning tree T of G, we say that T is a tree t-spanner of G if the distance between every pair of vertices in T is at most t times their distance in G. The p...
Yuval Emek, David Peleg
XIMEP
2005
ACM
150views Database» more  XIMEP 2005»
15 years 3 months ago
Updating the Pre/Post Plane in MonetDB/XQuery
We outline an efficient ACID-compliant mechanism for structural inserts and deletes in relational XML document storage that uses a region based pre/size/level encoding (equivalent...
Peter A. Boncz, Stefan Manegold, Jan Rittinger