Sciweavers

450 search results - page 33 / 90
» Satisfiability with Exponential Families
Sort
View
COCO
2011
Springer
221views Algorithms» more  COCO 2011»
13 years 11 months ago
Non-uniform ACC Circuit Lower Bounds
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MODm gates, where m > 1 is an arbitrary constant. We prove: • NTIME[2n ...
Ryan Williams
TABLEAUX
2007
Springer
15 years 6 months ago
Bounded Model Checking with Description Logic Reasoning
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...
Shoham Ben-David, Richard J. Trefler, Grant E. Wed...
ICIP
2006
IEEE
16 years 1 months ago
Region-Based Active Contour with Noise and Shape Priors
In this paper, we propose to combine formally noise and shape priors in region-based active contours. On the one hand, we use the general framework of exponential family as a prio...
Eric Saloux, François Lecellier, Gilles Aub...
ICPR
2004
IEEE
16 years 29 days ago
To FRAME or not to FRAME in Probabilistic Texture Modelling?
The maximum entropy principle is a cornerstone of FRAME (Filters, RAndom fields, and Maximum Entropy) model considered at times as a first-ever step towards a universal theory of ...
Georgy L. Gimel'farb, Luc J. Van Gool, Alexey Zale...
ICML
2007
IEEE
16 years 20 days ago
Simple, robust, scalable semi-supervised learning via expectation regularization
Although semi-supervised learning has been an active area of research, its use in deployed applications is still relatively rare because the methods are often difficult to impleme...
Gideon S. Mann, Andrew McCallum