Sciweavers

1243 search results - page 53 / 249
» Generating Trees on Multisets
Sort
View
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
14 years 3 months ago
Smoothed Analysis of Binary Search Trees
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
Bodo Manthey, Rüdiger Reischuk
INFOCOM
2003
IEEE
14 years 3 months ago
On Multicast Trees: Structure and Size Estimation
Abstract— This work presents a thorough investigation of the structure of multicast trees cut from the Internet and power-law topologies. Based on both generated topologies and r...
Danny Dolev, Osnat Mokryn, Yuval Shavitt
VLDB
1992
ACM
111views Database» more  VLDB 1992»
14 years 2 months ago
Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins
In this paper, we explore the execution of pipelined hash joins in a multiprocessor-based database system. To improve the query execution, an innovative approach on query executio...
Ming-Syan Chen, Ming-Ling Lo, Philip S. Yu, Honest...
AAAI
1998
13 years 11 months ago
Tree Based Discretization for Continuous State Space Reinforcement Learning
Reinforcement learning is an effective technique for learning action policies in discrete stochastic environments, but its efficiency can decay exponentially with the size of the ...
William T. B. Uther, Manuela M. Veloso
ENTCS
2006
117views more  ENTCS 2006»
13 years 10 months ago
Monadic Second-Order Logic and Transitive Closure Logics over Trees
Model theoretic syntax is concerned with studying the descriptive complexity of grammar formalisms for natural languages by defining their derivation trees in suitable logical for...
Hans-Jörg Tiede, Stephan Kepser