2520 search results - page 175 / 504 » The complexity of approximating entropy |
109
click to vote
SIBGRAPI
2008
IEEE
15 years 5 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...
EMSOFT
2004
Springer
15 years 4 months 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...
GISCIENCE
2004
Springer
15 years 4 months 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...
102
click to vote
STOC
2010
ACM
15 years 3 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...
107
click to vote
UAI
2008
15 years 13 days 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...