Searching for "Approximate Homomorphisms." – sorted by Relevance.
-
Bounding Performance Loss in Approximate MDP Homomorphisms
- Bounding Performance Loss in Approximate MDP Homomorphisms Jonathan J. Taylor Dept. of Computer
- Cited by 1 (1 self) – Add To MetaCart
-
Checking Approximate Computations over the Reals
- to an approximate checker for the other. In addition, we provide approximate checkers for generalized homomorphic
- Cited by 26 (8 self) – Add To MetaCart
-
An Algebraic Approach to Abstraction in Reinforcement Learning
- approximate homomorphisms on the concept of Bounded-parameter MDPs developed by Givan, Leach and Dean [21]. We
- Cited by 18 (1 self) – Add To MetaCart
-
Relativized Options: Choosing the Right Transformation
- ) and approximate homomorphisms. We cannot employ the method we developed in the previous section for choosing
- Cited by 11 (3 self) – Add To MetaCart
-
Exact probabilistic inference for inexact graph matching,” Apr. 2003, McGill Centre for Intelligent Machines. [Online]. Available: http://www.cim.mcgill.ca/ ∼ rbrook/graphs/graph.pdf [cited at p
- of two graphs that are approximately homomorphic. Practical results depend on careful definition of what
- Cited by 2 (0 self) – Add To MetaCart
-
On the Underspread/Overspread Classification of Random Processes
- an approximate homomorphism. Precisely, one has that the generalized Weyl symbol of two jointly underspread
- Cited by 1 (0 self) – Add To MetaCart
-
Strategies for the Lossless Encoding of Strings as Ada Identifiers
- should be approximately homomorphic with respect to length---i.e., if l(s 1 )l(s 2 ), then l(m(s 1 ))l
- Cited by 1 (0 self) – Add To MetaCart
-
Boolean functions with small spectral norm
- approximate homomorphism property. Lemma 3.5 (ψH is an approximate homomorphism). Suppose that f, g : G → R
- Cited by 1 (1 self) – Add To MetaCart
-
1.1 Preservation Theorems in Classical and Finite Model Theory
- equivalence approximates homomorphic equivalence “up to tree-depth n”. In a similar fashion, n
- Add To MetaCart
-
Language-Based Optimisation of Sensor-Driven Distributed Computing Applications
- for homomorphisms and then to argue that the approximate behaviour is ‘close enough’ for a given application. 2
- Add To MetaCart

