Sciweavers

945 search results - page 182 / 189
» Posix: A Model for Future Computing
Sort
View
ICML
1999
IEEE
15 years 10 months ago
Least-Squares Temporal Difference Learning
Excerpted from: Boyan, Justin. Learning Evaluation Functions for Global Optimization. Ph.D. thesis, Carnegie Mellon University, August 1998. (Available as Technical Report CMU-CS-...
Justin A. Boyan
WWW
2005
ACM
15 years 10 months ago
TrustGuard: countering vulnerabilities in reputation management for decentralized overlay networks
Reputation systems have been popular in estimating the trustworthiness and predicting the future behavior of nodes in a large-scale distributed system where nodes may transact wit...
Mudhakar Srivatsa, Li Xiong, Ling Liu
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
15 years 10 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
SIGMOD
2009
ACM
136views Database» more  SIGMOD 2009»
15 years 9 months ago
A comparison of approaches to large-scale data analysis
There is currently considerable enthusiasm around the MapReduce (MR) paradigm for large-scale data analysis [17]. Although the basic control flow of this framework has existed in ...
Andrew Pavlo, Erik Paulson, Alexander Rasin, Danie...
SIGMOD
2006
ACM
238views Database» more  SIGMOD 2006»
15 years 9 months ago
Continuous monitoring of top-k queries over sliding windows
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Pa...