5331 search results - page 733 / 1067 » Algebraic Methods for Optimization Problems |
147
Voted
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Sparse methods for supervised learning aim at finding good linear predictors from as few variables as possible, i.e., with small cardinality of their supports. This combinatorial ...
169
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...
185
click to vote
TCSV
2002
15 years 6 months ago
2002
In this paper, we address the problem of real-time video streaming over wireless LANs for both unicast and multicast transmission. The wireless channel is modeled as a packet-erasu...
187
click to vote
DEXAW
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—The k-means method is a simple and fast clustering technique that exhibits the problem of specifying the optimal number of clusters preliminarily. We address the problem...
303
click to vote
Book
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...