Sciweavers

699 search results - page 10 / 140
» Generalized Distance Functions in the Theory of Computation
Sort
View
73
Voted
CONCUR
2010
Springer
14 years 10 months ago
Simulation Distances
Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by realvalued distance functions between systems, wher...
Pavol Cerný, Thomas A. Henzinger, Arjun Rad...
CORR
2010
Springer
135views Education» more  CORR 2010»
14 years 9 months ago
Information Distance
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...
Charles H. Bennett, Péter Gács, Ming...
UMC
2000
15 years 1 months ago
Upper and Lower Bounds on Continuous-Time Computation
Abstract. We consider various extensions and modifications of Shannon's General Purpose Analog Computer, which is a model of computation by differential equations in continuou...
Manuel Lameiras Campagnolo, Cristopher Moore
COMPGEOM
2003
ACM
15 years 2 months ago
Finding a curve in a map
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran ...
MICCAI
2009
Springer
15 years 10 months ago
A Riemannian Framework for Orientation Distribution Function Computing
Compared with Diffusion Tensor Imaging (DTI), High Angular Resolution Imaging (HARDI) can better explore the complex microstructure of white matter. Orientation Distribution Functi...
Jian Cheng, Aurobrata Ghosh, Tianzi Jiang, Rachid ...