Sciweavers

1538 search results - page 69 / 308
» Relative Randomness and Cardinality
Sort
View
AAAI
2000
14 years 11 months ago
Redundancy in Random SAT Formulas
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
Yacine Boufkhad, Olivier Roussel
DAM
2008
88views more  DAM 2008»
14 years 10 months ago
Stochastic applications of media theory: Random walks on weak orders or partial orders
This paper presents the axioms of a real time random walk on the set of states of a medium and some of their consequences, such as the asymptotic probabilities of the states. The ...
Jean-Claude Falmagne, Yung-Fong Hsu, Fabio Leite, ...
RSA
2010
89views more  RSA 2010»
14 years 8 months ago
Some remarks on Betti numbers of random polygon spaces
Polygon spaces like Mℓ = {(u1, · · · , un) ∈ S1 × · · · S1 ; n i=1 liui = 0}/SO(2) or they three dimensional analogues Nℓ play an important rle in geometry and topolo...
Clément Dombry, Christian Mazza
ICIP
2010
IEEE
14 years 7 months ago
Randomized motion estimation
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...
Sylvain Boltz, Frank Nielsen
RSA
2011
124views more  RSA 2011»
14 years 4 months ago
Sparse random graphs with clustering
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
Béla Bollobás, Svante Janson, Oliver...