4539 search results - page 484 / 908 » Approaches to Compute Workflow Complexity |
209
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
264
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
192
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
199
click to vote
HIPC
2007
Springer
16 years 1 months ago
2007
Springer
The Fast Fourier Transform (FFT) is of primary importance and a fundamental kernel in many computationally intensive scientific applications. In this paper we investigate its perf...
337
click to vote
ICCS
2007
Springer
16 years 29 days ago
2007
Springer
Abstract. Manual surface reconstruction is still an everyday practice in applications involving complex irregular domains necessary for modeling biological systems. Rapid developme...