Sciweavers

241 search results - page 16 / 49
» Efficient Parallel Algorithms for Euclidean Distance Transfo...
Sort
View
JCB
2006
115views more  JCB 2006»
13 years 9 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger
ICIP
2007
IEEE
13 years 10 months ago
Motion Estimation using Tangent Distance
In this paper, we present a method based on tangent distance to estimate motion in image sequences. Tangent distance combines an intuitive understanding and effective modeling of ...
Jonathan Fabrizio, Séverine Dubuisson
EDBT
2004
ACM
126views Database» more  EDBT 2004»
14 years 9 months ago
Spatial Queries in the Presence of Obstacles
Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are dire...
Jun Zhang, Dimitris Papadias, Kyriakos Mouratidis,...
ICSE
2007
IEEE-ACM
14 years 9 months ago
DECKARD: Scalable and Accurate Tree-Based Detection of Code Clones
Detecting code clones has many software engineering applications. Existing approaches either do not scale to large code bases or are not robust against minor code modifications. I...
Ghassan Misherghi, Lingxiao Jiang, Stéphane...
IPPS
2010
IEEE
13 years 6 months ago
Exploring parallelism in short sequence mapping using Burrows-Wheeler Transform
Next-generation high throughput sequencing instruments are capable of generating hundreds of millions of reads in a single run. Mapping those reads to a reference genome is an ext...
Doruk Bozdag, Ayat Hatem, Ümit V. Çata...