Sciweavers

541 search results - page 98 / 109
» Factoring Solution Sets of Polynomial Systems in Parallel
Sort
View
GRID
2006
Springer
13 years 7 months ago
Toward an On-Demand Restricted Delegation Mechanism for Grids
Grids are intended to enable cross-organizational interactions which makes Grid security a challenging and nontrivial issue. In Grids, delegation is a key facility that can be used...
Mehran Ahsant, Jim Basney, Olle Mulmo, Adam J. Lee...
KDD
2007
ACM
153views Data Mining» more  KDD 2007»
14 years 8 months ago
Exploiting duality in summarization with deterministic guarantees
Summarization is an important task in data mining. A major challenge over the past years has been the efficient construction of fixed-space synopses that provide a deterministic q...
Panagiotis Karras, Dimitris Sacharidis, Nikos Mamo...
HPCA
1996
IEEE
13 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...
PDP
2011
IEEE
12 years 11 months ago
Quantifying Thread Vulnerability for Multicore Architectures
Abstract—Continuously reducing transistor sizes and aggressive low power operating modes employed by modern architectures tend to increase transient error rates. Concurrently, mu...
Isil Oz, Haluk Rahmi Topcuoglu, Mahmut T. Kandemir...
SPAA
2009
ACM
14 years 4 months ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...