Sciweavers

6365 search results - page 11 / 1273
» Fast Local Computation Algorithms
Sort
View
ICPR
2010
IEEE
15 years 3 months ago
Accurate Dense Stereo by Constraining Local Consistency on Superpixels
Segmentation is a low-level vision cue often deployed by stereo algorithms to assume that disparity within superpixels varies smoothly. In this paper, we show that constraining, o...
Stefano Mattoccia
99
Voted
KRMED
2008
15 years 1 months ago
Exploiting Fast Classification of SNOMED CT for Query and Integration of Health Data
By constructing local extensions to SNOMED we aim to enrich existing medical and related data stores, simplify the expression of complex queries, and establish a foundation for se...
Michael Lawley
AAAI
2010
15 years 1 months ago
Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments
We present a fast local search algorithm that finds an improved solution (if there is any) in the k-exchange neighborhood of the given solution to an instance of WEIGHTED FEEDBACK...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
92
Voted
ICPR
2002
IEEE
16 years 1 months ago
Reliable and Fast Eye Finding in Close-up Images
This paper describes a method for quickly and robustly localizing the iris and pupil boundaries of a human eye in close-up images. Such an algorithm can be critical for iris ident...
Theodore A. Camus, Richard P. Wildes
BMCBI
2004
125views more  BMCBI 2004»
15 years 6 days ago
A fast algorithm for determining the best combination of local alignments to a query sequence
Background: Existing sequence alignment algorithms assume that similarities between DNA or amino acid sequences are linearly ordered. That is, stretches of similar nucleotides or ...
Gavin C. Conant, Andreas Wagner