Sciweavers

539 search results - page 49 / 108
» Recurrence relations and fast algorithms
Sort
View
132
Voted
KDD
2012
ACM
196views Data Mining» more  KDD 2012»
13 years 2 months ago
Chromatic correlation clustering
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
Francesco Bonchi, Aristides Gionis, Francesco Gull...
WPES
2003
ACM
15 years 5 months ago
Secure and private sequence comparisons
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
Mikhail J. Atallah, Florian Kerschbaum, Wenliang D...
100
Voted
TNN
1998
123views more  TNN 1998»
15 years 3 days ago
A general framework for adaptive processing of data structures
—A structured organization of information is typically required by symbolic processing. On the other hand, most connectionist models assume that data are organized according to r...
Paolo Frasconi, Marco Gori, Alessandro Sperduti
3DIM
2007
IEEE
15 years 6 months ago
Cached k-d tree search for ICP algorithms
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...
EUROPAR
2009
Springer
14 years 10 months ago
A Parallel Point Matching Algorithm for Landmark Based Image Registration Using Multicore Platform
Abstract. Point matching is crucial for many computer vision applications. Establishing the correspondence between a large number of data points is a computationally intensive proc...
Lin Yang, Leiguang Gong, Hong Zhang, John L. Noshe...