603 search results - page 21 / 121 » A General Approximation Technique for Constrained Forest Pro... |
118
click to vote
ECML
2007
Springer
15 years 7 months ago
2007
Springer
L1 regularization is effective for feature selection, but the resulting optimization is challenging due to the non-differentiability of the 1-norm. In this paper we compare state...
127
click to vote
ICCSA
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algori...
117
click to vote
SPAA
2010
ACM
15 years 6 months ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
117
click to vote
FOCS
2000
IEEE
15 years 5 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
130
click to vote
NECO
1998
15 years 1 months ago
1998
three different levels of abstraction: detailed models including ctivity dynamics, weight dynamics that abstract from the neural activity dynamics by an adiabatic approximation, an...