2957 search results - page 282 / 592 » The Complexity of Polynomial-Time Approximation |
301
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
198
click to vote
SIBGRAPI
2008
IEEE
16 years 1 months ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
193
click to vote
EMSOFT
2004
Springer
16 years 2 days ago
2004
Springer
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
179
click to vote
GISCIENCE
2004
Springer
16 years 1 days ago
2004
Springer
The spatial auto-regression (SAR) model is a popular spatial data analysis technique, which has been used in many applications with geo-spatial datasets. However, exact solutions f...
209
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...