Sciweavers

5592 search results - page 81 / 1119
» On Random Betweenness Constraints
Sort
View
RSA
2010
118views more  RSA 2010»
13 years 4 months ago
Asymptotic equivalence and contiguity of some random graphs
We show that asymptotic equivalence, in a strong form, holds between two random graph models with slightly differing edge probabilities under substantially weaker conditions than w...
Svante Janson
ACL
2009
13 years 7 months ago
Markov Random Topic Fields
Most approaches to topic modeling assume an independence between documents that is frequently violated. We present an topic model that makes use of one or more user-specified grap...
Hal Daume III
IJCAI
2003
13 years 11 months ago
A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint
In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and ...
Alejandro López-Ortiz, Claude-Guy Quimper, ...
STOC
1993
ACM
123views Algorithms» more  STOC 1993»
14 years 2 months ago
Constructing small sample spaces satisfying given constraints
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
Daphne Koller, Nimrod Megiddo
ISCI
2010
118views more  ISCI 2010»
13 years 8 months ago
Approximations of upper and lower probabilities by measurable selections
A random set can be regarded as the result of the imprecise observation of a random variable. Following this interpretation, we study to which extent the upper and lower probabili...
Enrique Miranda, Inés Couso, Pedro Gil