Sciweavers

284 search results - page 27 / 57
» What Matchings Can Be Stable
Sort
View
ECCV
2002
Springer
14 years 10 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel
VLDB
1994
ACM
120views Database» more  VLDB 1994»
14 years 16 days ago
Indexing Multiple Sets
Index structures for multiple sets can be classified into those that group entries according to their key values and those that group entries according to their set membership. Th...
Christoph Kilger, Guido Moerkotte
EVOW
2005
Springer
14 years 2 months ago
Convergence Synthesis of Dynamic Frequency Modulation Tones Using an Evolution Strategy
This paper reports on steps that have been taken to enhance previously presented evolutionary sound matching work. In doing so, the convergence characteristics are shown to provide...
Thomas J. Mitchell, Anthony G. Pipe
ICPR
2008
IEEE
14 years 2 months ago
Grading nuclear pleomorphism on histological micrographs
A mainstay in cancer diagnostics is the classification or grading of cell nuclei based on their appearance. While the analysis of cytological samples has been automated successful...
Eric Cosatto, Matthew Miller, Hans Peter Graf, Joh...
ICSE
1999
IEEE-ACM
14 years 22 days ago
Splitting the Organization and Integrating the Code: Conway's Law Revisited
It is widely acknowledged that coordination of large scale software development is an extremely difficult and persistent problem. Since the structure of the code mirrors the struc...
James D. Herbsleb, Rebecca E. Grinter