Sciweavers

2957 search results - page 417 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
JMLR
2008
133views more  JMLR 2008»
15 years 6 months ago
Algorithms for Sparse Linear Classifiers in the Massive Data Setting
Classifiers favoring sparse solutions, such as support vector machines, relevance vector machines, LASSO-regression based classifiers, etc., provide competitive methods for classi...
Suhrid Balakrishnan, David Madigan
EOR
2007
84views more  EOR 2007»
15 years 6 months ago
The multi-layered network design problem
act 11 We address the problem of designing a network built on several layers. This problem occurs in practical applications 12 but has not been studied extensively from the point o...
Arnaud Knippel, Benoit Lardeux
FOCM
2007
48views more  FOCM 2007»
15 years 6 months ago
Integration and Optimization of Multivariate Polynomials by Restriction onto a Random Subspace
Abstract. We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in Rn and related problems of complex integration and opt...
Alexander I. Barvinok
ORL
2008
90views more  ORL 2008»
15 years 6 months ago
Optimal bundle pricing with monotonicity constraint
We consider the problem to sell items to a set of bidders. Bidders bid on bundles of items, and each item's availability is unbounded, like for digital goods. We need to dete...
Alexander Grigoriev, Joyce van Loon, Maxim Sviride...
TSP
2008
124views more  TSP 2008»
15 years 6 months ago
Dictionary Preconditioning for Greedy Algorithms
This article introduces the concept of sensing dictionaries. It presents an alteration of greedy algorithms like thresholding or (Orthogonal) Matching Pursuit which improves their...
Karin Schnass, Pierre Vandergheynst