11345 search results - page 2027 / 2269 » Foundations of Computer Science |
134
click to vote
LICS
2003
IEEE
15 years 8 months ago
2003
IEEE
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
132
click to vote
SCCC
2003
IEEE
15 years 8 months ago
2003
IEEE
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...
141
click to vote
KCAP
2003
ACM
15 years 8 months ago
2003
ACM
While existing learning techniques can be viewed as inducing programs from examples, most research has focused on rather narrow classes of programs, e.g., decision trees or logic ...
124
Voted
SENSYS
2003
ACM
15 years 8 months ago
2003
ACM
In this paper we examine the role of very simple and noisy sensors for the tracking problem. We propose a binary sensor model, where each sensor’s value is converted reliably to...
126
click to vote
SMA
2003
ACM
15 years 8 months ago
2003
ACM
Parametric feature-based CAD data exchange is one of the most important open problems in solid modeling. The problem is significant and challenging both scientifically and comme...