Sciweavers

4581 search results - page 491 / 917
» Computing Transformation Semigroups
Sort
View
GI
2009
Springer
15 years 11 months ago
Towards copy-evident JPEG images
Abstract: We present a technique for adding a high-frequency pattern to JPEG images that is imperceptible to the unaided eye, but turns into a clearly readable largeletter warning ...
Andrew Lewis, Markus Kuhn
GI
2009
Springer
15 years 11 months ago
Reasoning about Contextual Equivalence: From Untyped to Polymorphically Typed Calculi
: This paper describes a syntactical method for contextual equivalence in polymorphically typed lambda-calculi. Our specific calculus has letrec as cyclic let, data constructors, ...
David Sabel, Manfred Schmidt-Schauß, Frederi...
GI
2009
Springer
15 years 11 months ago
Reinventing Haskell Backtracking
: Almost ten years ago, Ralf Hinze has written a functional pearl on how to derive backtracking functionality for the purely functional programming language Haskell. In these notes...
Sebastian Fischer
ECAGENTS
2001
Springer
150views ECommerce» more  ECAGENTS 2001»
15 years 11 months ago
Security Issues in M-Commerce: A Usage-Based Taxonomy
Abstract. M–commerce is a new area arising from the marriage of electronic commerce with emerging mobile and pervasive computing technology. The newness of this area—and the ra...
Suresh Chari, Parviz Kermani, Sean W. Smith, Leand...
STACS
2001
Springer
15 years 11 months ago
Small PCPs with Low Query Complexity
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
Prahladh Harsha, Madhu Sudan