Sciweavers

10493 search results - page 1940 / 2099
» Dynamic Word Problems
Sort
View
CIKM
2008
Springer
13 years 10 months ago
TinyLex: static n-gram index pruning with perfect recall
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
Derrick Coetzee
ETVC
2008
13 years 10 months ago
Sparse Multiscale Patches for Image Processing
Abstract. This paper presents a framework to define an objective measure of the similarity (or dissimilarity) between two images for image processing. The problem is twofold: 1) de...
Paolo Piro, Sandrine Anthoine, Eric Debreuve, Mich...
FOSSACS
2008
Springer
13 years 9 months ago
Footprints in Local Reasoning
Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...
Mohammad Raza, Philippa Gardner
APVIS
2007
13 years 9 months ago
Particle-based volume rendering
: In this paper, we apply Particle-based Volume Rendering (PBVR) technique using a current programmable GPU architecture. Recently, the increasing programmability of GPU offers an ...
Naohisa Sakamoto, Jorji Nonaka, Koji Koyamada, Sat...
DAGSTUHL
2007
13 years 9 months ago
How Fast can be Algebraic Attacks on Block Ciphers?
In this paper we give a specification of a new block cipher that can be called the Courtois Toy Cipher (CTC). It is quite simple, and yet very much like any other known block ciph...
Nicolas Courtois
« Prev « First page 1940 / 2099 Last » Next »