6266 search results - page 88 / 1254 » New results on the computability and complexity of points - ... |
BIRTHDAY
2010
Springer
13 years 10 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
POPL
2008
ACM
14 years 9 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
AAAI
2000
13 years 10 months ago
2000
The complexity of numerical domain partitioning depends on the number of potential cut points. In multiway partitioning this dependency is often quadratic, even exponential. There...
ICALP
2000
Springer
14 years 15 days ago
2000
Springer
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
GIS
2007
ACM
14 years 10 months ago
2007
ACM
We propose a new multi-scale terrain model, based on a hierarchical representation for the morphology of a terrain. The basis of our morphological model is a dual Morse decomposit...