Sciweavers

16404 search results - page 2972 / 3281
» A set coverage problem
Sort
View
WWW
2006
ACM
16 years 6 months ago
WS-replication: a framework for highly available web services
Due to the rapid acceptance of web services and its fast spreading, a number of mission-critical systems will be deployed as web services in next years. The availability of those ...
Jorge Salas, Francisco Perez-Sorrosal, Marta Pati&...
WWW
2005
ACM
16 years 6 months ago
Three-level caching for efficient query processing in large Web search engines
Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple...
Xiaohui Long, Torsten Suel
PPOPP
2009
ACM
16 years 6 months ago
Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
Tong Li, Dan P. Baumberger, Scott Hahn
PODC
2009
ACM
16 years 6 months ago
Brief announcement: global consistency can be easier than point-to-point communication
Global consistency or Byzantine Agreement (BA) and reliable point-to-point communication are two of the most important and well-studied problems in distributed computing. Informal...
Prasant Gopal, Anuj Gupta, Pranav K. Vasishta, Piy...
152
Voted
KDD
2009
ACM
152views Data Mining» more  KDD 2009»
16 years 6 months ago
TANGENT: a novel, 'Surprise me', recommendation algorithm
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...
Kensuke Onuma, Hanghang Tong, Christos Faloutsos
« Prev « First page 2972 / 3281 Last » Next »