Sciweavers

450 search results - page 59 / 90
» Satisfiability with Exponential Families
Sort
View
WINE
2005
Springer
179views Economy» more  WINE 2005»
15 years 5 months ago
A Graph-Theoretic Network Security Game
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...
CP
2000
Springer
15 years 3 months ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao
TIT
2011
157views more  TIT 2011»
14 years 6 months ago
Universal and Composite Hypothesis Testing via Mismatched Divergence
—For the universal hypothesis testing problem, where the goal is to decide between the known null hypothesis distribution and some other unknown distribution, Hoeffding proposed ...
Jayakrishnan Unnikrishnan, Dayu Huang, Sean P. Mey...
CVPR
2006
IEEE
16 years 1 months ago
Shape from Shading: Recognizing the Mountains through a Global View
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...
Qihui Zhu, Jianbo Shi
ICIP
2006
IEEE
16 years 1 months ago
Exact Local Reconstruction Algorithms for Signals with Finite Rate of Innovation
Consider the problem of sampling signals which are not bandlimited, but still have a finite number of degrees of freedom per unit of time, such as, for example, piecewise polynomi...
Pier Luigi Dragotti, Martin Vetterli, Thierry Blu