Sciweavers

8838 search results - page 435 / 1768
» Generalizing Domain Theory
Sort
View
TIT
1998
63views more  TIT 1998»
15 years 7 months ago
Operational Capacity and Pseudoclassicality of a Quantum Channel
We explore some basic properties of coding theory of a general quantum communication channel and its operational capacity, including (1) adaptive measurement with feedback code, (...
Akio Fujiwara, Hiroshi Nagaoka
CVPR
1996
IEEE
16 years 9 months ago
Canonical Decomposition of Steerable Functions
This paper presents a general formulation enabling determination of all functions that are steerable under any transformation group. These steerable functions are determinedunique...
Yacov Hel-Or, Patrick C. Teo
STOC
2006
ACM
125views Algorithms» more  STOC 2006»
16 years 8 months ago
On earthmover distance, metric labeling, and 0-extension
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yu...
PODS
2008
ACM
120views Database» more  PODS 2008»
16 years 7 months ago
Effective characterizations of tree logics
A survey of effective characterizations of tree logics. If L is a logic, then an effective characterization for L is an algorithm, which inputs a tree automaton and replies if the...
Mikolaj Bojanzyk
LATA
2010
Springer
16 years 5 months ago
Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R)
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...
Neda Saeedloei and Gopal Gupta