Sciweavers

1949 search results - page 317 / 390
» Random graphs on surfaces
Sort
View
CPM
2011
Springer
283views Combinatorics» more  CPM 2011»
14 years 3 months ago
Frequent Submap Discovery
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
Stéphane Gosselin, Guillaume Damiand, Chris...
ICALP
2011
Springer
14 years 3 months ago
Clustering with Local Restrictions
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...
Daniel Lokshtanov, Dániel Marx
INFOCOM
2011
IEEE
14 years 3 months ago
SigSag: Iterative detection through soft message-passing
—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...
Arash Saber Tehrani, Alexandros G. Dimakis, Michae...
AAAI
2011
13 years 12 months ago
Exploiting Phase Transition in Latent Networks for Clustering
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...
Vahed Qazvinian, Dragomir R. Radev
ICCV
2009
IEEE
2301views Computer Vision» more  ICCV 2009»
16 years 4 months ago
Class Segmentation and Object Localization with Superpixel Neighborhoods
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...
Brian Fulkerson, Andrea Vedaldi, Stefano Soatto