3874 search results - page 290 / 775 » Approximation Algorithms for k-hurdle Problems |
152
Voted
VLDB
2005
ACM
15 years 10 months ago
2005
ACM
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
158
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
134
Voted
IWPEC
2009
Springer
15 years 11 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
145
click to vote
TALG
2010
15 years 3 months ago
2010
We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in...
154
click to vote
ESWS
2009
Springer
15 years 11 months ago
2009
Springer
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...