54 search results - page 3 / 11 » List Homomorphism with Accumulation |
AMAST
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Accumulation techniques were invented to transform functional programs, which intensively use append functions (like inefficient list reversal), into more efficient progr...
PKC
2009
Springer
14 years 8 months ago
2009
Springer
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...
LOPSTR
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is t...
CIVR
2008
Springer
13 years 9 months ago
2008
Springer
In this paper, a motion-based approach for detecting highlevel semantic events in video sequences is presented. Its main characteristic is its generic nature, i.e. it can be direc...
SIAMDM
2008
13 years 7 months ago
2008
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...