7930 search results - page 338 / 1586 » Greedy in Approximation Algorithms |
215
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We propose a dynamic process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of i...
210
click to vote
MOBIHOC
2010
ACM
15 years 4 months ago
2010
ACM
We investigate the performance of longest-queue-first (LQF) scheduling (i.e., greedy maximal scheduling) for wireless networks under the SINR interference model. This interference...
180
click to vote
DMIN
2009
15 years 4 months ago
2009
-- The proliferation of social networks, where individuals share private information, has caused, in the last few years, a growth in the volume of sensitive data being stored in th...
226
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—In this paper we address the problem of scalable and load balanced routing for wireless sensor networks. Motivated by the analog of the continuous setting that geodesic routing ...
291
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...