Sciweavers

1511 search results - page 61 / 303
» Randomness, lowness and degrees
Sort
View
RSA
2010
108views more  RSA 2010»
14 years 10 months ago
Resolvent of large random graphs
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and deri...
Charles Bordenave, Marc Lelarge
ECAI
2006
Springer
15 years 3 months ago
Compiling Possibilistic Knowledge Bases
Abstract. Possibilistic knowledge bases gather propositional formulas associated with degrees belonging to a linearly ordered scale. These degrees reflect certainty or priority, de...
Salem Benferhat, Henri Prade
AML
2010
88views more  AML 2010»
14 years 12 months ago
Relativized Schnorr tests with universal behavior
A Schnorr test relative to some oracle A may informally be called "universal" if it covers all Schnorr tests. Since no true universal Schnorr test exists, such an A cann...
Nicholas Rupprecht
COMPGEOM
2006
ACM
15 years 5 months ago
Random triangulations of planar point sets
Let S be a finite set of n + 3 points in general position in the plane, with 3 extreme points and n interior points. We consider triangulations drawn uniformly at random from the...
Micha Sharir, Emo Welzl
CORR
2012
Springer
173views Education» more  CORR 2012»
13 years 7 months ago
A new approach to the orientation of random hypergraphs
A h-uniform hypergraph H = (V, E) is called ( , k)-orientable if there exists an assignment of each hyperedge e ∈ E to exactly of its vertices v ∈ e such that no vertex is ass...
Marc Lelarge