Sciweavers

2000 search results - page 138 / 400
» Program Transformation and Proof Transformation
Sort
View
125
Voted
CRYPTO
2007
Springer
106views Cryptology» more  CRYPTO 2007»
15 years 9 months ago
Simulatable VRFs with Applications to Multi-theorem NIZK
Abstract. This paper introduces simulatable verifiable random functions (sVRF). VRFs are similar to pseudorandom functions, except that they are also verifiable: corresponding to...
Melissa Chase, Anna Lysyanskaya
112
Voted
CVPR
2008
IEEE
16 years 5 months ago
A polynomial-time bound for matching and registration with outliers
We present a framework for computing optimal transformations, aligning one point set to another, in the presence of outliers. Example applications include shape matching and regis...
Carl Olsson, Olof Enqvist, Fredrik Kahl
111
Voted
DOCENG
2009
ACM
15 years 10 months ago
On the analysis of queries with counting constraints
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
Everardo Bárcenas, Pierre Genevès, N...
138
Voted
DATE
2007
IEEE
150views Hardware» more  DATE 2007»
15 years 10 months ago
Fast memory footprint estimation based on maximal dependency vector calculation
In data dominated applications, loop transformations have a huge impact on the lifetime of array data and therefore on memory footprint. Since a locally optimal loop transformatio...
Qubo Hu, Arnout Vandecappelle, Per Gunnar Kjeldsbe...
135
Voted
KBSE
1999
IEEE
15 years 7 months ago
Evolving Object-Oriented Designs with Refactorings
Refactorings are behavior-preserving program transformations that automate design evolution in object-oriented applications. Three kinds of design evolution are: schema transformat...
Lance Tokuda, Don S. Batory