Sciweavers

710 search results - page 15 / 142
» On Minimum Power Connectivity Problems
Sort
View
INFOCOM
2008
IEEE
14 years 1 months ago
Constrained Relay Node Placement in Wireless Sensor Networks to Meet Connectivity and Survivability Requirements
— The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectiv...
Satyajayant Misra, Seung Don Hong, Guoliang Xue, J...
APPROX
2009
Springer
195views Algorithms» more  APPROX 2009»
14 years 2 months ago
Approximating Node-Connectivity Augmentation Problems
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
Zeev Nutov
APPROX
2000
Springer
190views Algorithms» more  APPROX 2000»
13 years 12 months ago
Approximating node connectivity problems via set covers
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
Guy Kortsarz, Zeev Nutov
CNSR
2005
IEEE
116views Communications» more  CNSR 2005»
14 years 1 months ago
Connectivity with Static Transmission Range in Vehicular Ad Hoc Networks
Connectivity in mobile wireless ad-hoc networks is maintained by setting the transmission range so that a node can establish a link to any other node in the network either directl...
Maen M. Artimy, William J. Phillips, William Rober...
CVPR
2010
IEEE
13 years 4 months ago
Curious snakes: A minimum latency solution to the cluttered background problem in active contours
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...
Ganesh Sundaramoorthi, Stefano Soatto, Anthony J. ...