1591 search results - page 164 / 319 » Random lifts of graphs |
183
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
166
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
187
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
170
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
180
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Markov Random Field is now ubiquitous in many formulations
of various vision problems. Recently, optimization
of higher-order potentials became practical using higherorder
graph...