Sciweavers

4865 search results - page 540 / 973
» The Complexity of Graph Connectivity
Sort
View
ICCV
2005
IEEE
16 years 9 months ago
A Spectral Technique for Correspondence Problems Using Pairwise Constraints
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the p...
Marius Leordeanu, Martial Hebert
ICCV
2001
IEEE
16 years 9 months ago
Image Segmentation with Minimum Mean Cut
We introduce a new graph-theoretic approach to image segmentation based on minimizing a novel class of `mean cut' cost functions. Minimizing these cost functions corresponds ...
Song Wang, Jeffrey Mark Siskind
ECCV
2008
Springer
16 years 9 months ago
Automated Delineation of Dendritic Networks in Noisy Image Stacks
We present a novel approach to 3D delineation of dendritic networks in noisy image stacks. We achieve a level of automation beyond that of stateof-the-art systems, which model dend...
Germán González, François Fle...
MSWIM
2009
ACM
16 years 1 months ago
HUBCODE: message forwarding using hub-based network coding in delay tolerant networks
Most people-centric delay tolerant networks have been shown to exhibit power-law behavior. Analysis of the temporal connectivity graph of such networks reveals the existence of hu...
Shabbir Ahmed, Salil S. Kanhere
INFOCOM
2009
IEEE
16 years 1 months ago
Assessing the Vulnerability of the Fiber Infrastructure to Disasters
—Communication networks are vulnerable to natural disasters, such as earthquakes or floods, as well as to physical attacks, such as an Electromagnetic Pulse (EMP) attack. Such r...
Sebastian Neumayer, Gil Zussman, Reuven Cohen, Eyt...