Sciweavers

1080 search results - page 196 / 216
» The Complexity of Belief Update
Sort
View
127
Voted
PKC
2009
Springer
210views Cryptology» more  PKC 2009»
16 years 2 months ago
Controlling Access to an Oblivious Database Using Stateful Anonymous Credentials
In this work, we consider the task of allowing a content provider to enforce complex access control policies on oblivious protocols conducted with anonymous users. As our primary ...
Scott E. Coull, Matthew Green, Susan Hohenberger
137
Voted
KDD
2001
ACM
231views Data Mining» more  KDD 2001»
16 years 2 months ago
A Framework for Efficient and Anonymous Web Usage Mining Based on Client-Side Tracking
Web Usage Mining (WUM), a natural application of data mining techniques to the data collected from user interactions with the web, has greatly concerned both academia and industry ...
Cyrus Shahabi, Farnoush Banaei Kashani
HPCA
2007
IEEE
16 years 2 months ago
MemTracker: Efficient and Programmable Support for Memory Access Monitoring and Debugging
Memory bugs are a broad class of bugs that is becoming increasingly common with increasing software complexity, and many of these bugs are also security vulnerabilities. Unfortuna...
Guru Venkataramani, Brandyn Roemer, Yan Solihin, M...
POPL
2008
ACM
16 years 2 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
120
Voted
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 2 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