7150 search results - page 392 / 1430 » An Approximation Algorithm for Approximation Rank |
197
click to vote
IMC
2006
ACM
16 years 23 days ago
2006
ACM
Pattern matching and analysis over network data streams is increasingly becoming an essential primitive of network monitoring systems. It is a fundamental part of most intrusion d...
235
click to vote
ECCV
2010
Springer
16 years 1 days ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
210
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
216
click to vote
UAI
2008
15 years 8 months ago
2008
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
189
click to vote
JACM
2000
15 years 6 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...