104 search results - page 1 / 21 » Dependency trees in sub-linear time and bounded memory |
VLDB
2006
ACM
14 years 5 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
ESA
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. This paper addresses the informational asymmetry for constructing an ultrametric evolutionary tree from upper and lower bounds on pairwise distances between n given speci...
SPAA
2010
ACM
13 years 9 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We consider Metropolis Glauber dynamics for sampling proper qcolourings of the n-vertex complete b-ary tree when 3 q b/2 ln(b). We give both upper and lower bounds on the mixing...
CRYPTO
2006
Springer
13 years 8 months ago
2006
Springer
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...