1518 search results - page 132 / 304 » Exact and Approximate Bandwidth |
FOCS
1992
IEEE
15 years 2 months ago
1992
IEEE
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilisticall...
FAW
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. Closeness centrality is an important concept in social network analysis. In a graph representing a social network, closeness centrality measures how close a vertex is to ...
NIPS
2003
14 years 11 months ago
2003
This paper addresses the problem of untangling hidden graphs from a set of noisy detections of undirected edges. We present a model of the generation of the observed graph that in...
96
Voted
UAI
2000
2000
Probabilistic Arc Consistency: A Connection between Constraint Reasoning and Probabilistic Reasoning
14 years 11 months ago
We document a connection between constraint reasoning and probabilistic reasoning. We present an algorithm, called probabilistic arc consistency, which is both a generalization of...
97
Voted
CAGD
2008
14 years 10 months ago
2008
In the present paper we give account of an effort that aimed at the unification of the whole geometric preprocessing that preceded the wind tunnel readings with a realistic airpla...