153 search results - page 26 / 31 » Approximating node connectivity problems via set covers |
111
click to vote
JSAC
2008
14 years 11 months ago
2008
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
111
click to vote
ICDM
2010
IEEE
14 years 9 months ago
2010
IEEE
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
111
click to vote
COMCOM
2004
14 years 11 months ago
2004
In multihop wavelength division multiplexing systems, a connection between two communication nodes consists of one or more lightpaths. A wavelength conversion is required at the j...
136
click to vote
ICDM
2006
IEEE
15 years 5 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
122
click to vote
ICPP
2009
IEEE
15 years 6 months ago
2009
IEEE
—Wireless sensor networks have become a promising technology in monitoring physical world. In many applications with wireless sensor networks, it is essential to understand how w...