Sciweavers

5441 search results - page 953 / 1089
» Improving the Performance of Recommender Systems That Use Cr...
Sort
View
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 6 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
PODS
2005
ACM
151views Database» more  PODS 2005»
16 years 6 months ago
Estimating arbitrary subset sums with few probes
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...
WWW
2009
ACM
16 years 7 months ago
A trust management framework for service-oriented environments
Many reputation management systems have been developed under the assumption that each entity in the system will use a variant of the same scoring function. Much of the previous wo...
William Conner, Arun Iyengar, Thomas A. Mikalsen, ...
ICDCS
2009
IEEE
16 years 1 months ago
Towards Optimal Resource Utilization in Heterogeneous P2P Streaming
Though plenty of research has been conducted to improve Internet P2P streaming quality perceived by endusers, little has been known about the upper bounds of achievable performanc...
Dongyu Liu, Fei Li, Songqing Chen
LCTRTS
2007
Springer
16 years 19 days ago
Generalizing parametric timing analysis
In the design of real-time and embedded systems, it is important to establish a bound on the worst-case execution time (WCET) of programs to assure via schedulability analysis tha...
Joel Coffman, Christopher A. Healy, Frank Mueller,...