Sciweavers

5158 search results - page 195 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
CAV
2009
Springer
181views Hardware» more  CAV 2009»
16 years 7 months ago
Size-Change Termination, Monotonicity Constraints and Ranking Functions
Abstract. Size-change termination involves deducing program termination based on the impossibility of infinite descent. To this end we may use m abstraction in which transitions ar...
Amir M. Ben-Amram
CORR
2011
Springer
191views Education» more  CORR 2011»
15 years 1 months ago
Picturing classical and quantum Bayesian inference
We introduce a graphical framework for Bayesian inference that is sufficiently general to accommodate not just the standard case but also recent proposals for a theory of quantum...
Bob Coecke, Robert W. Spekkens
TSP
2010
15 years 1 months ago
MIMO transceiver optimization with linear constraints on transmitted signal covariance components
Abstract--This correspondence revisits the joint transceiver optimization problem for multiple-input multiple-output (MIMO) channels. The linear transceiver as well as the transcei...
Ching-Chih Weng, P. P. Vaidyanathan
POPL
2007
ACM
16 years 6 months ago
A typed intermediate language for compiling multiple inheritance
Type-preserving compilation can improve software reliability by generating code that can be verified independently of the compiler. Practical type-preserving compilation does not ...
Juan Chen
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
16 years 6 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy