2079 search results - page 332 / 416 » Universality of random graphs |
138
Voted
ICALP
2011
Springer
14 years 7 months ago
2011
Springer
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...
164
click to vote
INFOCOM
2011
IEEE
14 years 7 months ago
2011
IEEE
—The multiple-access framework of ZigZag decoding [1] is a useful technique for combating interference via multiple repeated transmissions, and is known to be compatible with dis...
148
click to vote
AAAI
2011
14 years 4 months ago
2011
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...
153
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
We propose a method to identify and localize object
classes in images. Instead of operating at the pixel level,
we advocate the use of superpixels as the basic unit of a
class s...
147
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
This paper introduces an algorithm for detecting walking
motion using point trajectories in video sequences. Given
a number of point trajectories, we identify those which are
sp...