Sciweavers

420 search results - page 39 / 84
» Generating random regular graphs
Sort
View
RSA
2008
80views more  RSA 2008»
13 years 7 months ago
A spectral technique for random satisfiable 3CNF formulas
Let I be a random 3CNF formula generated by choosing a truth assignment for variables x1, . . . , xn uniformly at random and including every clause with i literals set true by w...
Abraham Flaxman
ITA
2006
13 years 7 months ago
Probabilistic models for pattern statistics
In this work we study some probabilistic models for the random generation of words over a given alphabet used in the literature in connection with pattern statistics. Our goal is t...
Massimiliano Goldwurm, Roberto Radicioni
ICML
2008
IEEE
14 years 8 months ago
Fast estimation of first-order clause coverage through randomization and maximum likelihood
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
Filip Zelezný, Ondrej Kuzelka
SIGMETRICS
2005
ACM
14 years 1 months ago
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
—To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to li...
Derek Leonard, Vivek Rai, Dmitri Loguinov
FGR
2008
IEEE
346views Biometrics» more  FGR 2008»
14 years 2 months ago
Markov random field models for hair and face segmentation
This paper presents an algorithm for measuring hair and face appearance in 2D images. Our approach starts by using learned mixture models of color and location information to sugg...
Kuang-chih Lee, Dragomir Anguelov, Baris Sumengen,...