Sciweavers

668 search results - page 62 / 134
» Hyperrelations in version space
Sort
View
PLDI
1995
ACM
14 years 9 days ago
Selective Specialization for Object-Oriented Languages
Dynamic dispatching is a major source of run-time overhead in object-oriented languages, due both to the direct cost of method lookup and to the indirect effect of preventing othe...
Jeffrey Dean, Craig Chambers, David Grove
ETVC
2008
13 years 10 months ago
Sparse Multiscale Patches for Image Processing
Abstract. This paper presents a framework to define an objective measure of the similarity (or dissimilarity) between two images for image processing. The problem is twofold: 1) de...
Paolo Piro, Sandrine Anthoine, Eric Debreuve, Mich...
SODA
1997
ACM
169views Algorithms» more  SODA 1997»
13 years 10 months ago
Partial Matching of Planar Polylines Under Similarity Transformations
Given two planar polylines T and P with n and m edges, respectively, we present an Om2 n2  time, Omn space algorithm to nd portions of the text" T which are similar in sh...
Scott D. Cohen, Leonidas J. Guibas

Publication
3460views
15 years 10 months ago
Multistencils Fast Marching Methods: A Highly Accurate Solution to the Eikonal Equation on Cartesian Domains
A wide range of computer vision applications require an accurate solution of a particular Hamilton-Jacobi (HJ) equation known as the Eikonal equation. In this paper, we propose an ...
M. Sabry Hassouna, Aly A. Farag
ICDE
2002
IEEE
143views Database» more  ICDE 2002»
14 years 10 months ago
Discovering Similar Multidimensional Trajectories
We investigate techniques for analysis and retrieval of object trajectories in a two or three dimensional space. Such kind of data usually contain a great amount of noise, that ma...
Michail Vlachos, Dimitrios Gunopulos, George Kolli...