Sciweavers

4604 search results - page 75 / 921
» Correlation-based Data Representation
Sort
View
CPM
2008
Springer
134views Combinatorics» more  CPM 2008»
14 years 11 months ago
An Improved Succinct Representation for Dynamic k-ary Trees
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
Diego Arroyuelo
AMW
2010
14 years 11 months ago
What You Must Remember When Processing Data Words
We provide a Myhill-Nerode-like theorem that characterizes the class of data languages recognized by deterministic finite-memory automata (DMA). As a byproduct of this characteriza...
Michael Benedikt, Clemens Ley, Gabriele Puppis
ICFP
2005
ACM
15 years 9 months ago
High-level views on low-level representations
This paper explains how the high-level treatment of datatypes in functional languages--using features like constructor functions and pattern matching--can be made to coexist with ...
Iavor S. Diatchki, Mark P. Jones, Rebekah Leslie
INTEGRATION
2007
100views more  INTEGRATION 2007»
14 years 9 months ago
A fast pipelined multi-mode DES architecture operating in IP representation
The Data Encryption Standard (DES) is a cipher that is still used in a broad range of applications, from smartcards, where it is often implemented as a tamperresistant embedded co...
Sylvain Guilley, Philippe Hoogvorst, Renaud Pacale...
ICANN
2005
Springer
15 years 3 months ago
Accurate and Robust Image Superresolution by Neural Processing of Local Image Representations
Image superresolution involves the processing of an image sequence to generate a still image with higher resolution. Classical approaches, such as bayesian MAP methods, require ite...
Carlos Miravet, Francisco de Borja Rodrígue...