Sciweavers

1439 search results - page 265 / 288
» Fast approximation of centrality
Sort
View
SIGUCCS
2003
ACM
14 years 3 months ago
Implementation of fee-based printing in student computing sites
After years of providing no-cost printing in its computing sites, the University of Delaware (UD) decided to move to a fee-based printing scheme for its student computing sites. T...
Carol Jarom, Steven J. Timmins
ATAL
2003
Springer
14 years 3 months ago
Cooperative negotiation for soft real-time distributed resource allocation
In this paper we present a cooperative negotiation protocol that solves a distributed resource allocation problem while conforming to soft real-time constraints in a dynamic envir...
Roger Mailler, Victor R. Lesser, Bryan Horling
SIGMETRICS
2010
ACM
214views Hardware» more  SIGMETRICS 2010»
14 years 2 months ago
Distributed sensor network localization from local connectivity: performance analysis for the HOP-TERRAIN algorithm
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
Amin Karbasi, Sewoong Oh
SIGMOD
2010
ACM
236views Database» more  SIGMOD 2010»
14 years 2 months ago
Differentially private aggregation of distributed time-series with transformation and encryption
We propose PASTE, the first differentially private aggregation algorithms for distributed time-series data that offer good practical utility without any trusted server. PASTE add...
Vibhor Rastogi, Suman Nath
WADS
2001
Springer
113views Algorithms» more  WADS 2001»
14 years 2 months ago
Movement Planning in the Presence of Flows
This paper investigates the problem of time-optimum movement planning in two and three dimensions for a point robot which has bounded control velocity through a set of n polygonal...
John H. Reif, Zheng Sun