10304 search results - page 1775 / 2061 » Computer science with the sciences: an emphasis in computati... |
183
click to vote
LICS
2003
IEEE
15 years 12 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...
174
click to vote
SCCC
2003
IEEE
15 years 12 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...
171
click to vote
SENSYS
2003
ACM
15 years 12 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...
171
click to vote
SMA
2003
ACM
15 years 12 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...
177
click to vote
AGTIVE
2003
Springer
15 years 12 months ago
2003
Springer
Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their spe...