7150 search results - page 249 / 1430 » An Approximation Algorithm for Approximation Rank |
207
Voted
KBS
2008
15 years 5 months ago
2008
Feature subset selection presents a common challenge for the applications where data with tens or hundreds of features are available. Existing feature selection algorithms are mai...
211
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
181
click to vote
ICIP
2000
IEEE
16 years 8 months ago
2000
IEEE
This paper describes an algorithm that achieves an approximately optimal assignment of forward error correction to progressive data within the unequal loss protection framework [1...
167
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
Let G = (V, E) be an undirected weighted graph with |V | = n and |E| = m. Let k 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn1/k ) expected time, construc...
189
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...