Sciweavers

2186 search results - page 260 / 438
» Considering an Organization's Memory
Sort
View
PLDI
2010
ACM
15 years 11 months ago
Traceable data types for self-adjusting computation
Self-adjusting computation provides an evaluation model where computations can respond automatically to modifications to their data by using a mechanism for propagating modifica...
Umut A. Acar, Guy E. Blelloch, Ruy Ley-Wild, Kanat...
INFOCOM
1999
IEEE
15 years 10 months ago
Matching Output Queueing with a Combined Input Output Queued Switch
-- The Internet is facing two problems simultaneously: there is a need for a faster switching/routing infrastructure, and a need to introduce guaranteed qualities of service (QoS)....
Shang-Tse Chuang, Ashish Goel, Nick McKeown, Balaj...
SIGMOD
1997
ACM
134views Database» more  SIGMOD 1997»
15 years 10 months ago
Scalable Parallel Data Mining for Association Rules
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
Eui-Hong Han, George Karypis, Vipin Kumar
HPCA
1996
IEEE
15 years 10 months ago
A Comparison of Entry Consistency and Lazy Release Consistency Implementations
This paper compares several implementations of entry consistency (EC) and lazy release consistency (LRC), two relaxed memory models in use with software distributed shared memory ...
Sarita V. Adve, Alan L. Cox, Sandhya Dwarkadas, Ra...
CRYPTO
2007
Springer
145views Cryptology» more  CRYPTO 2007»
15 years 10 months ago
Secure Identification and QKD in the Bounded-Quantum-Storage Model
We consider the problem of secure identification: user U proves to server S that he knows an agreed (possibly low-entropy) password w, while giving away as little information on w ...
Ivan Damgård, Serge Fehr, Louis Salvail, Chr...