1542 search results - page 178 / 309 » The metamathematics of random graphs |
123
click to vote
CIAC
2006
Springer
15 years 5 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...
110
click to vote
CORR
2006
Springer
15 years 1 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...
118
Voted
STOC
2005
ACM
16 years 2 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...
120
click to vote
ICCV
2009
IEEE
16 years 6 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...
104
Voted
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
The Cray MTA-2 system provides exceptional performance on a variety of sparse graph algorithms. Unfortunately, it was an extremely expensive platform. Cray is preparing an Eldorad...