2127 search results - page 58 / 426 » Computing large matchings fast |
160
click to vote
ICCV
2003
IEEE
16 years 5 months ago
2003
IEEE
A novel approach to pattern matching is presented, which reduces time complexity by two orders of magnitude compared to traditional approaches. The suggested approach uses an effi...
100
Voted
ICCV
2003
IEEE
16 years 5 months ago
2003
IEEE
This paper describes a PDE-based method for dense depth extraction from multiple wide-baseline images. Emphasis lies on the usage of only a small amount of images. The integration...
149
Voted
VALUETOOLS
2006
ACM
15 years 9 months ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
119
Voted
DATE
2007
IEEE
15 years 10 months ago
2007
IEEE
Content addressable memory (CAM) is widely used in many applications that require fast table lookup. Due to the parallel comparison feature and high frequency of lookup, however, ...
120
Voted
ECIS
2003
15 years 4 months ago
2003
Collaboration is vital for the survival of companies in today’s fast moving economy and, therefore, finding and matching partners is an important task. This is true for many dif...