1403 search results - page 116 / 281 » Set cover algorithms for very large datasets |
139
click to vote
GLOBECOM
2006
IEEE
15 years 10 months ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
173
Voted
SIAMJO
2010
15 years 2 months ago
2010
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
127
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents ar...
142
click to vote
ICIP
2001
IEEE
16 years 6 months ago
2001
IEEE
The proliferation of video content on the web makes similarity detection an indispensable tool in web data management, searching, and navigation. We have previously proposed a com...
146
click to vote
GLOBECOM
2007
IEEE
15 years 11 months ago
2007
IEEE
—Network lifetime is a critical issue in Wireless Sensor Networks. It is possible to extend network lifetime by organizing the sensors into a number of sensor covers. However, wi...