1299 search results - page 110 / 260 » Computing Minimal Diagnoses with Critical Set Algorithms |
WADS
2005
Springer
15 years 3 months ago
2005
Springer
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
122
click to vote
SPAA
1997
ACM
15 years 2 months ago
1997
ACM
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
ICIP
2000
IEEE
15 years 11 months ago
2000
IEEE
Projective transformations relate the coordinates of images that are taken by either a camera that undergoes only rotation while imaging an arbitrary scene, or one that rotates an...
RECOMB
2009
Springer
15 years 10 months ago
2009
Springer
Reconciliation between a set of gene trees and a species tree is the most commonly used approach to infer the duplication and loss events in the evolution of gene families, given a...
SPAA
1995
ACM
15 years 1 months ago
1995
ACM
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...