Sciweavers

2746 search results - page 33 / 550
» Bisubmodular Function Minimization
Sort
View
EMMCVPR
2001
Springer
15 years 6 months ago
Designing the Minimal Structure of Hidden Markov Model by Bisimulation
Hidden Markov Models (HMMs) are an useful and widely utilized approach to the modeling of data sequences. One of the problems related to this technique is finding the optimal stru...
Manuele Bicego, Agostino Dovier, Vittorio Murino
DAC
1999
ACM
15 years 6 months ago
Using Lower Bounds During Dynamic BDD Minimization
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
Rolf Drechsler, Wolfgang Günther
EUSFLAT
2009
175views Fuzzy Logic» more  EUSFLAT 2009»
14 years 11 months ago
The Minimization of the Risk of Falling in Portfolios under Uncertainty
Abstract-- A portfolio model to minimize the risk of falling under uncertainty is discussed. The risk of falling is represented by the value-at-risk of rate of return. Introducing ...
Yuji Yoshida
ICCV
2003
IEEE
16 years 3 months ago
Minimally-Supervised Classification using Multiple Observation Sets
This paper discusses building complex classifiers from a single labeled example and vast number of unlabeled observation sets, each derived from observation of a single process or...
Chris Stauffer
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 2 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy