2079 search results - page 264 / 416 » Universality of random graphs |
159
click to vote
APPROX
2011
Springer
14 years 4 months ago
2011
Springer
In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a “canonical” tester in which a set of vertices is selected at random and the...
156
click to vote
STOC
2004
ACM
16 years 5 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
150
click to vote
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
— We define “random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random wa...
140
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
163
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
Higher order energy functions have the ability to encode
high level structural dependencies between pixels, which
have been shown to be extremely powerful for image labeling
pro...