Sciweavers

6682 search results - page 1183 / 1337
» networks 2006
Sort
View
STOC
2006
ACM
134views Algorithms» more  STOC 2006»
16 years 6 months ago
Byzantine agreement in the full-information model in O(log n) rounds
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan
OSDI
2006
ACM
16 years 6 months ago
BrowserShield: Vulnerability-Driven Filtering of Dynamic HTML
Vulnerability-driven filtering of network data can offer a fast and easy-to-deploy alternative or intermediary to software patching, as exemplified in Shield [43]. In this paper, ...
Charles Reis, John Dunagan, Helen J. Wang, Opher D...
SIGMOD
2006
ACM
150views Database» more  SIGMOD 2006»
16 years 6 months ago
On-the-fly sharing for streamed aggregation
Data streaming systems are becoming essential for monitoring applications such as financial analysis and network intrusion detection. These systems often have to process many simi...
Sailesh Krishnamurthy, Chung Wu, Michael J. Frankl...
SIGMOD
2006
ACM
174views Database» more  SIGMOD 2006»
16 years 6 months ago
Dynamic authenticated index structures for outsourced databases
In outsourced database (ODB) systems the database owner publishes its data through a number of remote servers, with the goal of enabling clients at the edge of the network to acce...
Feifei Li, Marios Hadjieleftheriou, George Kollios...
PODS
2006
ACM
122views Database» more  PODS 2006»
16 years 6 months ago
Space- and time-efficient deterministic algorithms for biased quantiles over data streams
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
« Prev « First page 1183 / 1337 Last » Next »