213 search results - page 20 / 43 » Counting Independent Sets Using the Bethe Approximation |
DCC
2002
IEEE
15 years 11 months ago
2002
IEEE
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
CAV
2009
Springer
16 years 11 days ago
2009
Springer
Abstract. When a model does not satisfy a given specification, a counterexample is produced by the model checker to demonstrate the failure. A user must then examine the counterexa...
117
click to vote
TNN
2008
14 years 11 months ago
2008
Abstract--Large-margin methods, such as support vector machines (SVMs), have been very successful in classification problems. Recently, maximum margin discriminant analysis (MMDA) ...
CIMAGING
2010
15 years 1 months ago
2010
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...
SMA
2005
ACM
15 years 5 months ago
2005
ACM
Given a planar set S of arbitrary topology and a radius r, we show how to construct an r-tightening of S, which is a set whose boundary has a radius of curvature everywhere greate...