1068 search results - page 110 / 214 » Extremely randomized trees |
DCC
2001
IEEE
14 years 9 months ago
2001
IEEE
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
SLS
2007
Springer
14 years 4 months 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...
FSTTCS
2010
Springer
13 years 8 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...
SSD
2005
Springer
14 years 3 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...
PODC
2004
ACM
14 years 3 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...