2109 search results - page 269 / 422 » Solving Necklace Constraint Problems |
177
Voted
JMLR
2006
15 years 5 months ago
2006
Many kernel learning algorithms, including support vector machines, result in a kernel machine, such as a kernel classifier, whose key component is a weight vector in a feature sp...
132
Voted
MP
2010
15 years 3 months ago
2010
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
145
click to vote
SOFSEM
2007
Springer
15 years 11 months ago
2007
Springer
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...
184
Voted
SAC
2006
ACM
15 years 4 months ago
2006
ACM
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
159
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...