2127 search results - page 116 / 426 » Computing large matchings fast |
134
click to vote
AMR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. This article explores the feasibility of a market-ready, mobile pattern recognition system based on the latest findings in the field of object recognition and currently a...
155
Voted
ISPAN
1999
IEEE
15 years 8 months ago
1999
IEEE
To minimize the execution time of an iterative application in a heterogeneous parallel computing environment, an appropriate mapping scheme is needed for matching and scheduling th...
116
click to vote
VLSID
2002
IEEE
16 years 4 months ago
2002
IEEE
This paper presents the Smith and Waterman Algorithm-Specific ASIC Design (SWASAD) project. This is a hardware solution that implements the S&W algorithm.. The SWASAD is an imp...
149
click to vote
CONTEXT
2003
Springer
15 years 9 months ago
2003
Springer
The development of more and more complex distributed applications over large networks of computers has raised the problem of semantic interoperability across applications based on ...
122
Voted
CVPR
2001
IEEE
16 years 5 months ago
2001
IEEE
We present a new feature based algorithm for stereo correspondence. Most of the previous feature based methods match sparse features like edge pixels, producing only sparse dispar...