Sciweavers

5966 search results - page 1160 / 1194
» Distributed Caching Algorithms for Content Distribution Netw...
Sort
View
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 8 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
WSDM
2010
ACM
315views Data Mining» more  WSDM 2010»
14 years 5 months ago
SBotMiner: Large Scale Search Bot Detection
In this paper, we study search bot traffic from search engine query logs at a large scale. Although bots that generate search traffic aggressively can be easily detected, a large ...
Fang Yu, Yinglian Xie, Qifa Ke
EUROSYS
2008
ACM
14 years 4 months ago
DepSpace: a byzantine fault-tolerant coordination service
The tuple space coordination model is one of the most interesting coordination models for open distributed systems due to its space and time decoupling and its synchronization pow...
Alysson Neves Bessani, Eduardo Adílio Pelin...
SOSP
2005
ACM
14 years 4 months ago
BAR fault tolerance for cooperative services
This paper describes a general approach to constructing cooperative services that span multiple administrative domains. In such environments, protocols must tolerate both Byzantin...
Amitanand S. Aiyer, Lorenzo Alvisi, Allen Clement,...
MOBICOM
2009
ACM
14 years 2 months ago
SurroundSense: mobile phone localization via ambience fingerprinting
A growing number of mobile computing applications are centered around the user’s location. The notion of location is broad, ranging from physical coordinates (latitude/longitude...
Martin Azizyan, Ionut Constandache, Romit Roy Chou...
« Prev « First page 1160 / 1194 Last » Next »