Sciweavers

243 search results - page 33 / 49
» On Balanced Graphs
Sort
View
INFOCOM
2006
IEEE
15 years 5 months ago
Landmark-Based Information Storage and Retrieval in Sensor Networks
— For a wide variety of sensor network environments, location information is unavailable or expensive to obtain. We propose a location-free, lightweight, distributed, and data-ce...
Qing Fang, Jie Gao, Leonidas J. Guibas
SIGECOM
2004
ACM
86views ECommerce» more  SIGECOM 2004»
15 years 5 months ago
Mechanisms for a spatially distributed market
We consider the problem of a spatially distributed market with strategic agents. A single good is traded in a set of independent markets, where shipment between markets is possibl...
Moshe Babaioff, Noam Nisan, Elan Pavlov
LREC
2010
177views Education» more  LREC 2010»
15 years 1 months ago
Finding Domain Terms using Wikipedia
In this paper we present a new approach for obtaining the terminology of a given domain using the category and page structures of the Wikipedia in a language independent way. The ...
Jorge Vivaldi, Horacio Rodríguez
JSAC
2008
98views more  JSAC 2008»
14 years 11 months ago
Randomized consensus algorithms over large scale networks
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
Fabio Fagnani, Sandro Zampieri
INFOCOM
2011
IEEE
14 years 3 months ago
Sharing multiple messages over mobile networks
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...
Yuxin Chen, Sanjay Shakkottai, Jeffrey G. Andrews