16 search results - page 1 / 4 » Analytic equivalence relations and bi-embeddability |
JSYML
2011
12 years 11 months ago
2011
Abstract. Louveau and Rosendal [5] have shown that the relation of biembeddability for countable graphs as well as for many other natural classes of countable structures is complet...
ICDT
2012
ACM
11 years 7 months ago
2012
ACM
The problems of query containment, equivalence, and minimization are recognized as very important in the context of query processing, specifically of query optimization. In their...
AUTOMATICA
2005
13 years 4 months ago
2005
Various techniques of system identification exist that provide a nominal model and an uncertainty bound. An important question is what the implications are for the particular choi...
ICIP
2007
IEEE
13 years 4 months ago
2007
IEEE
We introduce a method to improve performance of multiple-description coding based on legacy video coders with pre- and postprocessing. The pre- and post-processing setup is genera...
IANDC
2006
13 years 4 months ago
2006
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulatio...