187 search results - page 8 / 38 » On the uniform edge-partition of a tree |
93
Voted
LICS
2005
IEEE
15 years 3 months ago
2005
IEEE
We provide a uniform solution to the problem of synthesizing a finite-state distributed system. An instance of the synthesis problem consists of a system architecture and a tempo...
SODA
1996
ACM
14 years 10 months ago
1996
ACM
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
FSTTCS
2010
Springer
14 years 7 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...
92
Voted
CACM
1998
14 years 9 months ago
1998
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...