Sciweavers

4277 search results - page 348 / 856
» On Multiple Linear Approximations
Sort
View
CVPR
2010
IEEE
15 years 8 months ago
Efficient Additive Kernels via Explicit Feature Maps
Maji and Berg [13] have recently introduced an explicit feature map approximating the intersection kernel. This enables efficient learning methods for linear kernels to be applied...
Andrea Vedaldi, Andrew Zisserman
APPROX
2008
Springer
173views Algorithms» more  APPROX 2008»
15 years 1 months ago
Connected Vertex Covers in Dense Graphs
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
Jean Cardinal, Eythan Levy
SODA
2008
ACM
200views Algorithms» more  SODA 2008»
15 years 1 months ago
Clustering for metric and non-metric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
Marcel R. Ackermann, Johannes Blömer, Christi...
AUTOMATICA
2004
125views more  AUTOMATICA 2004»
14 years 11 months ago
Hamiltonian discretization of boundary control systems
A fundamental problem in the simulation and control of complex physical systems containing distributed-parameter components concerns finite-dimensional approximation. Numerical me...
Goran Golo, Viswanath Talasila, Arjan van der Scha...
MP
1998
109views more  MP 1998»
14 years 11 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra