5606 search results - page 405 / 1122 » Randomization Techniques for Graphs. |
225
click to vote
ECSQARU
2009
Springer
16 years 1 months ago
2009
Springer
A BN2O network is a Bayesian network having the structure of a bipartite graph with all edges directed from one part (the top level) toward the other (the bottom level) and where a...
208
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
151
click to vote
STOC
1995
ACM
15 years 10 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
161
click to vote
SODA
1996
ACM
15 years 8 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...
175
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...