849 search results - page 86 / 170 » Completely Non-malleable Schemes |
82
Voted
ICPR
2002
IEEE
16 years 1 months ago
2002
IEEE
The Stack algorithm, which is a best-first search algorithm widely used in speech recognition, is modified for application to the problem of recognizing machine printed text in th...
111
click to vote
CADE
2008
Springer
16 years 28 days ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
104
Voted
FOSSACS
2010
Springer
15 years 7 months ago
2010
Springer
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...
73
Voted
DASFAA
2009
IEEE
15 years 7 months ago
2009
IEEE
This paper investigates the problem of writing data to passive RFID tag memory and proposes a reprocessing model for assuring the atomicity and durability of writing transactions i...
101
Voted
ICC
2009
IEEE
15 years 7 months ago
2009
IEEE
—We study the energy performance of random linear network coding for time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and rece...