1511 search results - page 61 / 303 » Randomness, lowness and degrees |
153
click to vote
RSA
2010
15 years 4 months ago
2010
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...
147
click to vote
ECAI
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. Possibilistic knowledge bases gather propositional formulas associated with degrees belonging to a linearly ordered scale. These degrees reflect certainty or priority, de...
157
click to vote
AML
2010
15 years 6 months ago
2010
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...
157
click to vote
COMPGEOM
2006
ACM
16 years 3 days ago
2006
ACM
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...
173
click to vote
CORR
2012
Springer
14 years 1 months ago
2012
Springer
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...