3708 search results - page 366 / 742 » Approximating Betweenness Centrality |
181
Voted
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
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...
160
click to vote
WADS
2001
Springer
15 years 11 months ago
2001
Springer
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...
194
click to vote
INFOCOM
1999
IEEE
15 years 11 months ago
1999
IEEE
-- The Internet is facing two problems simultaneously: there is a need for a faster switching/routing infrastructure, and a need to introduce guaranteed qualities of service (QoS)....
254
Voted
INFOCOM
1998
IEEE
15 years 11 months ago
1998
IEEE
We present the Informed-Source Coding-On-Demand (ISCOD) approach for efficiently supplying non-identical data from a central server to multiple caching clients through a broadcast ...
232
click to vote
INFOCOM
1998
IEEE
15 years 11 months ago
1998
IEEE
To support the Internet's explosive growth and expansion into a true integrated services network, there is a need for cost-effective switching technologies that can simultaneo...