1204 search results - page 151 / 241 » Hybrid Probabilistic Programs |
ESANN
2008
15 years 2 months ago
2008
Sequential Minimal Optimization (SMO) is currently the most popular algorithm to solve large quadratic programs for Support Vector Machine (SVM) training. For many variants of this...
118
Voted
SODA
2004
ACM
15 years 2 months ago
2004
ACM
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
AUTOMATICA
2006
15 years 1 months ago
2006
In this paper we solve the general problem of designing a feedback controller to reach a set of facets of an n-dimensional simplex in finite time, for a system evolving with linea...
119
click to vote
DAC
2007
ACM
16 years 2 months ago
2007
ACM
We discover significant value-dependent programming energy variations in multi-level cell (MLC) flash memories, and introduce an energy-aware data compression method that minimize...
87
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
In this paper we initiate the study of discrete random variables over domains. Our work is inspired by work of Daniele Varacca, who devised indexed valuations as models of probabi...