206 search results - page 16 / 42 » Constant factor approximation algorithm for the knapsack med... |
130
click to vote
FOCS
2004
IEEE
15 years 6 months ago
2004
IEEE
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...
147
click to vote
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
We consider a variant of the classic multi-armed bandit problem (MAB), which we call FEEDBACK MAB, where the reward obtained by playing each of n independent arms varies according...
119
click to vote
FOCS
2004
IEEE
15 years 6 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
154
click to vote
PODS
2007
ACM
16 years 3 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
141
click to vote
MOC
2002
15 years 2 months ago
2002
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...