1389 search results - page 67 / 278 » Improved Approximation Algorithms for Label Cover Problems |
154
click to vote
PODS
2003
ACM
16 years 3 months ago
2003
ACM
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
118
click to vote
SODA
2000
ACM
15 years 4 months ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
153
click to vote
ATAL
2005
Springer
15 years 8 months ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
208
click to vote
VLDB
2007
ACM
16 years 3 months ago
2007
ACM
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
153
click to vote
TCBB
2011
14 years 9 months ago
2011
—Protein identification is a key and essential step in mass spectrometry (MS) based proteome research. To date, there are many protein identification strategies that employ eithe...