Sciweavers

29908 search results - page 348 / 5982
» On the complexity of communication complexity
Sort
View
CVPR
1998
IEEE
16 years 7 months ago
A New Complex Basis for Implicit Polynomial Curves and its Simple Exploitation for Pose Estimation and Invariant Recognition
New representations are developed for 2D IP (implicit polynomial) curves ofarbitrary degree. These representations permit shape recognition and pose estimation with essentially sin...
David B. Cooper, Jean-Philippe Tarel
GIS
2007
ACM
16 years 7 months ago
Multi-scale dual morse complexes for representing terrain morphology
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...
Emanuele Danovaro, Leila De Floriani, Maria Vitali...
ISBI
2006
IEEE
16 years 7 months ago
Complex wavelets for registration of tagged MRI sequences
Tagged Magnetic Resonance Imaging (MRI) is currently the reference MR modality for myocardial motion and strain analysis. Mutual Information (MI) based non rigid registration has ...
Estanislao Oubel, Alejandro F. Frangi, Alfred O. H...
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
16 years 7 months ago
The Complexity of Andersen's Analysis in Practice
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
Manu Sridharan, Stephen J. Fink
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
16 years 7 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy