Sciweavers

8094 search results - page 156 / 1619
» Improvements in Formula Generalization
Sort
View
81
Voted
CORR
2007
Springer
57views Education» more  CORR 2007»
14 years 10 months ago
On Evaluating the Rate-Distortion Function of Sources with Feed-Forward and the Capacity of Channels with Feedback
— In this work, we study the problem of evaluating the performance limit of two communication problems that are closely related to each other- source coding with feed-forward and...
Ramji Venkataramanan, S. Sandeep Pradhan
78
Voted
JMLR
2006
107views more  JMLR 2006»
14 years 10 months ago
Bounds for the Loss in Probability of Correct Classification Under Model Based Approximation
In many pattern recognition/classification problem the true class conditional model and class probabilities are approximated for reasons of reducing complexity and/or of statistic...
Magnus Ekdahl, Timo Koski
81
Voted
LMCS
2006
119views more  LMCS 2006»
14 years 10 months ago
The monadic second-order logic of graphs XVI : Canonical graph decompositions
This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more ge...
Bruno Courcelle
65
Voted
SIAMCO
2002
89views more  SIAMCO 2002»
14 years 9 months ago
Convexity in Zero-Sum Differential Games
A new approach to two-player zero-sum differential games with convex-concave cost function is presented. It employs the tools of convex and variational analysis. A necessary and s...
Rafal Goebel
82
Voted
DM
2008
107views more  DM 2008»
14 years 8 months ago
Set maps, umbral calculus, and the chromatic polynomial
Some important properties of the chromatic polynomial also hold for any polynomial set map satisfying pS(x + y) = TU=S pT (x)pU (y). Using umbral calculus, we give a formula for t...
Gus Wiseman