Sciweavers

635 search results - page 103 / 127
» Some Computational Problems Related to Pseudo-intents
Sort
View
JMIV
2007
143views more  JMIV 2007»
14 years 11 months ago
Measures for Benchmarking of Automatic Correspondence Algorithms
Automatic localisation of correspondences for the construction of Statistical Shape Models from examples has been the focus of intense research during the last decade. Several alg...
Anders Ericsson, Johan Karlsson
ICPR
2004
IEEE
16 years 28 days ago
Discriminative Distance Measures for Image Matching
: Significant progress has been made by the computer vision community in recent years along two fronts: (i) developing complex spatial-temporal models for object registration and t...
Tat-Jen Cham, Xi Chen
RECOMB
2004
Springer
16 years 4 days ago
Designing multiple simultaneous seeds for DNA similarity search
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...
Yanni Sun, Jeremy Buhler
WDAG
2009
Springer
160views Algorithms» more  WDAG 2009»
15 years 4 months ago
Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems
This paper defines the basic notions of local and non-local tasks, and determines the minimum information about failures that is necessary to solve any non-local task in message-p...
Carole Delporte-Gallet, Hugues Fauconnier, Sam Tou...
I3
2007
15 years 1 months ago
Identity: How to name it, How to find it
The main objective of this work is to exploit the relationship between the information findability problem and a subject-based organization of information. Identification of a sub...
Christo Dichev, Darina Dicheva, Jan Fischer