Sciweavers

2695 search results - page 225 / 539
» The Complexity of Forecast Testing
Sort
View
CADE
2008
Springer
16 years 5 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
PODS
2003
ACM
114views Database» more  PODS 2003»
16 years 5 months ago
An information-theoretic approach to normal forms for relational and XML data
Normalization as a way of producing good database designs is a well-understood topic. However, the same problem of distinguishing well-designed databases from poorly designed ones...
Marcelo Arenas, Leonid Libkin
PODS
2007
ACM
104views Database» more  PODS 2007»
16 years 5 months ago
XML transformation by tree-walking transducers with invisible pebbles
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samw...
STACS
2010
Springer
16 years 13 hour ago
An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
François Le Gall
ICASSP
2009
IEEE
15 years 11 months ago
Distance blurring for space-variant image coding
We present a novel selective blurring algorithm that mimics the optical distance blur effects that occur naturally in cameras and eyes. The proposed algorithm provides a realistic...
Tim Popkin, Andrea Cavallaro, David Hands