1060 search results - page 122 / 212 » On the Discovery of Random Trees |
190
click to vote
SLS
2007
Springer
16 years 13 days ago
2007
Springer
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
159
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
We study the average number of transitions in Glushkov automata built from random regular expressions. This statistic highly depends on the probabilistic distribution set on the e...
176
click to vote
SSD
2005
Springer
15 years 11 months ago
2005
Springer
Most recent research on querying and managing data streams has concentrated on traditional data models where the data come in the form of tuples or XML data. Complex types of strea...
210
click to vote
PODC
2004
ACM
15 years 11 months ago
2004
ACM
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
193
click to vote
ICS
2009
Tsinghua U.
15 years 11 months ago
2009
Tsinghua U.
New static source routing algorithms for High Performance Computing (HPC) are presented in this work. The target parallel architectures are based on the commonly used fattree netw...