Sciweavers

412 search results - page 61 / 83
» Categories for the working mathematician: making the impossi...
Sort
View
JCDL
2005
ACM
156views Education» more  JCDL 2005»
14 years 1 months ago
A generic alerting service for digital libraries
Users of modern digital libraries (DLs) can keep themselves up-to-date by searching and browsing their favorite collections, or more conveniently by resorting to an alerting servi...
George Buchanan, Annika Hinze
PODC
2005
ACM
14 years 1 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
PODC
2005
ACM
14 years 1 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
WPES
2005
ACM
14 years 1 months ago
The privacy cost of the second-chance offer
This paper examines a generalization of a two-stage game common on eBay: an ascending-price auction followed by price discrimination (the second chance offer). High bids in the a...
Sumit Joshi, Yu-An Sun, Poorvi L. Vora
KDD
2005
ACM
149views Data Mining» more  KDD 2005»
14 years 1 months ago
A distributed learning framework for heterogeneous data sources
We present a probabilistic model-based framework for distributed learning that takes into account privacy restrictions and is applicable to scenarios where the different sites ha...
Srujana Merugu, Joydeep Ghosh