1603 search results - page 227 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
190
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Learning object categories from small samples is a challenging problem, where machine learning tools can in general provide very few guarantees. Exploiting prior knowledge may be ...
159
click to vote
ISCAS
2005
IEEE
16 years 15 hour ago
2005
IEEE
— This paper introduces a heuristic solution to the multiple restricted multiplication (MRM) optimization problem. MRM refers to a situation where a single variable is multiplied...
142
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Bounding constraints are used to bound the tolerance of solutions under certain undesirable features. Standard solvers propagate them one by one. Often times, it is easy to satisfy...
165
click to vote
DBSEC
2010
15 years 7 months ago
2010
This work treats the problem of error-resilient DNA searching via oblivious evaluation of finite automata, formulated as follows: a client has a DNA sequence, and a service provid...
159
click to vote
AUTOMATICA
2004
15 years 6 months ago
2004
In this paper, we discuss semidefinite relaxation techniques for computing minimal size ellipsoids that bound the solution set of a system of uncertain linear equations. The propo...