Sciweavers

785 search results - page 90 / 157
» Binary Join Trees
Sort
View
AAIM
2007
Springer
120views Algorithms» more  AAIM 2007»
15 years 1 months ago
Online OVSF Code Assignment with Resource Augmentation
Abstract. Orthogonal Variable Spreading Factor (OVSF) code assignment is a fundamental problem in Wideband Code-Division MultipleAccess (W-CDMA) systems, which play an important ro...
Francis Y. L. Chin, Yong Zhang, Hong Zhu
IS
2010
14 years 8 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley
ICDE
2007
IEEE
220views Database» more  ICDE 2007»
15 years 11 months ago
Structural Selectivity Estimation for XML Documents
Estimating the selectivity of queries is a crucial problem in database systems. Virtually all database systems rely on the use of selectivity estimates to choose amongst the many ...
Damien K. Fisher, Sebastian Maneth
INFOCOM
2009
IEEE
15 years 4 months ago
Hyperbolic Embedding and Routing for Dynamic Graphs
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
Andrej Cvetkovski, Mark Crovella
JCB
2008
71views more  JCB 2008»
14 years 9 months ago
Short Quartet Puzzling: A New Quartet-Based Phylogeny Reconstruction Algorithm
Quartet-based phylogeny reconstruction methods, such as Quartet Puzzling, were introduced in the hope that they might be competitive with maximum likelihood methods, without being...
Sagi Snir, Tandy Warnow, Satish Rao