Sciweavers

192 search results - page 37 / 39
» On Graph Isomorphism for Restricted Graph Classes
Sort
View
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 3 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
107
Voted
CORR
2010
Springer
154views Education» more  CORR 2010»
15 years 1 months ago
Causal Markov condition for submodular information measures
The causal Markov condition (CMC) is a postulate that links observations to causality. It describes the conditional independences among the observations that are entailed by a cau...
Bastian Steudel, Dominik Janzing, Bernhard Sch&oum...
FOCS
2003
IEEE
15 years 7 months ago
Bounded Geometries, Fractals, and Low-Distortion Embeddings
The doubling constant of a metric space (X, d) is the smallest value λ such that every ball in X can be covered by λ balls of half the radius. The doubling dimension of X is the...
Anupam Gupta, Robert Krauthgamer, James R. Lee
CP
2000
Springer
15 years 6 months ago
Boosting Search with Variable Elimination
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
Javier Larrosa
ACTAC
1998
71views more  ACTAC 1998»
15 years 1 months ago
On the Information Content of Semi-Structured Databases
In a semi-structured database there is no clear separation between the data and the schema, and the degree to which it is structured depends on the application. Semi-structured da...
Mark Levene