7129 search results - page 470 / 1426 » Approximation Algorithms for Treewidth |
150
click to vote
PDPTA
2007
15 years 8 months ago
2007
Abstract In this paper we investigate the composition of cheap network storage resources to meet specific availability and capacity requirements. We show that the problem of find...
139
click to vote
ESANN
2000
15 years 7 months ago
2000
: Recurrent neural networks possess interesting universal approximation capabilities, making them good candidates for time series modeling. Unfortunately, long term dependencies ar...
203
click to vote
UAI
1998
15 years 7 months ago
1998
In recent years there has been a flurry of works on learning Bayesian networks from data. One of the hard problems in this area is how to effectively learn the structure of a beli...
190
click to vote
OL
2007
15 years 6 months ago
2007
We propose an SQP-type algorithm for solving nonlinear second-order cone programming (NSOCP) problems. At every iteration, the algorithm solves a convex SOCP subproblem in which th...
173
click to vote
FOCS
2007
IEEE
16 years 25 days ago
2007
IEEE
We consider approximation algorithms for buy-at-bulk network design, with the additional constraint that demand pairs be protected against edge or node failures in the network. In...