Sciweavers

5606 search results - page 289 / 1122
» Randomization Techniques for Graphs.
Sort
View
ISCA
2010
IEEE
284views Hardware» more  ISCA 2010»
16 years 9 days ago
Security refresh: prevent malicious wear-out and increase durability for phase-change memory with dynamically randomized address
Phase change memory (PCM) is an emerging memory technology for future computing systems. Compared to other non-volatile memory alternatives, PCM is more matured to production, and...
Nak Hee Seong, Dong Hyuk Woo, Hsien-Hsin S. Lee
ICCD
1997
IEEE
94views Hardware» more  ICCD 1997»
15 years 11 months ago
Pseudo-Random Pattern Testing of Bridging Faults
: This paper studies pseudo-random pattern testing of bridging faults. Although bridging faults are generally more random pattern testable than stuck-at faults, examples are shown ...
Nur A. Touba, Edward J. McCluskey
CPHYSICS
2006
204views more  CPHYSICS 2006»
15 years 7 months ago
Genetically controlled random search: a global optimization method for continuous multidimensional functions
A new stochastic method for locating the global minimum of a multidimensional function inside a rectangular hyperbox is presented. A sampling technique is employed that makes use ...
Ioannis G. Tsoulos, Isaac E. Lagaris
FOCS
2009
IEEE
16 years 2 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
EDBT
2010
ACM
138views Database» more  EDBT 2010»
16 years 1 days ago
How to authenticate graphs without leaking
Secure data sharing in multi-party environments requires that both authenticity and confidentiality of the data be assured. Digital signature schemes are commonly employed for au...
Ashish Kundu, Elisa Bertino