Sciweavers

221 search results - page 3 / 45
» Regular implementation in the space of compactly supported f...
Sort
View
POPL
2008
ACM
14 years 7 months ago
Boomerang: resourceful lenses for string data
A lens is a bidirectional program. When read from left to right, it denotes an ordinary function that maps inputs to outputs. When read from right to left, it denotes an "upd...
Aaron Bohannon, J. Nathan Foster, Benjamin C. Pier...
ECBS
2007
IEEE
122views Hardware» more  ECBS 2007»
14 years 1 months ago
Time- and Space-Efficient Evaluation of Sparse Boolean Functions in Embedded Software
The paper addresses software implementation of large sparse systems of Boolean functions. Fast evaluation of such functions with the smallest memory consumption is often required ...
Vaclav Dvorak
ISMVL
2003
IEEE
112views Hardware» more  ISMVL 2003»
14 years 9 days ago
Iterative Symmetry Indices Decomposition for Ternary Logic Synthesis in Three-Dimensional Space
This paper introduces the implementation of the Iterative Symmetry Indices Decomposition (ISID) for the synthesis of ternary threedimensional logic circuits. The synthesis of regu...
Anas Al-Rabadi
SCALESPACE
2005
Springer
14 years 16 days ago
Regularity and Scale-Space Properties of Fractional High Order Linear Filtering
We investigate the use of fractional powers of the Laplacian for signal and image simplification. We focus both on their corresponding variational techniques and parabolic pseudod...
Stephan Didas, Bernhard Burgeth, Atsushi Imiya, Jo...
INFOCOM
2011
IEEE
12 years 10 months ago
Approximate distance queries and compact routing in sparse graphs
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...