Sciweavers

19866 search results - page 344 / 3974
» Computing all factorizations in ***
Sort
View
HPCA
1996
IEEE
15 years 11 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...
WISEC
2010
ACM
15 years 7 months ago
Mobile user location-specific encryption (MULE): using your office as your password
Data breaches due to stolen laptops are a major problem. Solutions exist to secure sensitive files on laptops, but are rarely deployed because users view them as inconvenient. Thi...
Ahren Studer, Adrian Perrig
CAD
2005
Springer
15 years 6 months ago
Computer-aided design of porous artifacts
Heterogeneous structures represent an important new frontier for 21st century engineering. Human tissues, composites, `smart' and multimaterial objects are all physically man...
Craig A. Schroeder, William C. Regli, Ali Shokoufa...
PPOPP
2012
ACM
14 years 2 months ago
Better speedups using simpler parallel programming for graph connectivity and biconnectivity
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
James A. Edwards, Uzi Vishkin
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
16 years 1 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman