1542 search results - page 190 / 309 » The metamathematics of random graphs |
107
click to vote
FOCS
2002
IEEE
15 years 6 months ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
107
click to vote
NIPS
2003
15 years 3 months ago
2003
In this paper we present Discriminative Random Fields (DRF), a discriminative framework for the classification of natural image regions by incorporating neighborhood spatial depe...
102
click to vote
CONNECTION
2006
15 years 1 months ago
2006
Models of associative memory usually have full connectivity or if diluted, random symmetric connectivity. In contrast, biological neural systems have predominantly local, non-symm...
132
click to vote
IJAHUC
2008
15 years 1 months ago
2008
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...
130
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
Abstract. In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust ...