2095 search results - page 285 / 419 » Improved pebbling bounds |
187
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
269
Voted
PODS
2009
ACM
16 years 7 months ago
2009
ACM
We study privacy-preserving query answering over data containing relationships. A social network is a prime example of such data, where the nodes represent individuals and edges r...
209
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
187
click to vote
MOBICOM
2005
ACM
16 years 9 days ago
2005
ACM
In this paper we investigate the benefits of a heterogeneous architecture for wireless sensor networks composed of a few resource rich mobile nodes and a large number of simple s...
160
click to vote
STOC
2005
ACM
16 years 9 days ago
2005
ACM
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...