Sciweavers

3394 search results - page 558 / 679
» A Modal Model of Memory
Sort
View
130
Voted
PODC
2012
ACM
13 years 6 months ago
Faster randomized consensus with an oblivious adversary
Two new algorithms are given for randomized consensus in a shared-memory model with an oblivious adversary. Each is based on a new construction of a conciliator, an object that gu...
James Aspnes
SIAMCOMP
2012
13 years 6 months ago
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Mo...
PODS
2009
ACM
112views Database» more  PODS 2009»
16 years 4 months ago
Optimal sampling from sliding windows
APPEARED IN ACM PODS-2009. A sliding windows model is an important case of the streaming model, where only the most "recent" elements remain active and the rest are disc...
Vladimir Braverman, Rafail Ostrovsky, Carlo Zaniol...
XMLSEC
2003
ACM
15 years 9 months ago
Access control of XML documents considering update operations
As a large quantity of information is presented in XML format on the Web, there are increasing demands for XML security. Until now, research on XML security has been focused on th...
Chung-Hwan Lim, Seog Park, Sang Hyuk Son
MM
2000
ACM
91views Multimedia» more  MM 2000»
15 years 8 months ago
A prediction system for multimedia pre-fetching in Internet
The rapid development of Internet has resulted in more and more multimedia in Web content. However, due to the limitation in the bandwidth and huge size of the multimedia data, us...
Zhong Su, Qiang Yang, HongJiang Zhang