Sciweavers

1414 search results - page 41 / 283
» Randomness and Universal Machines
Sort
View

Lecture Notes
673views
15 years 6 months ago
Combinatorial Algorithms
"This is a standard senior-level algorithms class required of every computer science undergraduate and graduate student at the University of Illinois."
Jeff Erickson
ENTCS
2008
129views more  ENTCS 2008»
13 years 8 months ago
The York Abstract Machine
Abstract Machine Greg Manning1 Detlef Plump2 Department of Computer Science The University of York, UK duce the York Abstract Machine (YAM) for implementing the graph programming ...
Greg Manning, Detlef Plump
ATS
2009
IEEE
119views Hardware» more  ATS 2009»
14 years 3 months ago
Fault Diagnosis Using Test Primitives in Random Access Memories
As diagnostic testing for memory devices increasingly gains in importance, companies are looking for flexible, cost effective methods to perform diagnostics on their failing devi...
Zaid Al-Ars, Said Hamdioui
FSE
2007
Springer
115views Cryptology» more  FSE 2007»
14 years 2 months ago
Improving the Security of MACs Via Randomized Message Preprocessing
Abstract. “Hash then encrypt” is an approach to message authentication, where first the message is hashed down using an ε-universal hash function, and then the resulting k-bi...
Yevgeniy Dodis, Krzysztof Pietrzak
ICIP
2009
IEEE
14 years 7 months ago
Edge-preserving Colorization using Data-Driven Random Walks with Restart
In this paper, we consider the colorization problem of grayscale images in which some color scribbles are initially given. Our proposed method is based on the weighted color blendi...
Tae Hoon Kim (Seoul National University), Kyoung M...