Sciweavers

101 search results - page 5 / 21
» Fast approximation of the permanent for very dense problems
Sort
View
CVPR
2004
IEEE
14 years 9 months ago
Window-Based, Discontinuity Preserving Stereo
Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper, ...
Motilal Agrawal, Larry S. Davis
CVPR
2010
IEEE
13 years 6 months ago
Transform Coding for Fast Approximate Nearest Neighbor Search in High Dimensions
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
Jonathan Brandt
SCAM
2007
IEEE
14 years 1 months ago
Fast Approximate Matching of Programs for Protecting Libre/Open Source Software by Using Spatial Indexes
To encourage open source/libre software development, it is desirable to have tools that can help to identify open source license violations. This paper describes the implementatio...
Arnoldo José Müller Molina, Takeshi Sh...
ICCV
1999
IEEE
14 years 9 months ago
Fast Approximate Energy Minimization via Graph Cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
Yuri Boykov, Olga Veksler, Ramin Zabih
IPPS
2002
IEEE
14 years 10 days ago
Fast Inductance Extraction of Large VLSI Circuits
Accurate estimation of signal delay is critical to the design and verification of VLSI circuits. At very high frequencies, signal delay in circuits with small feature sizes is do...
Hemant Mahawar, Vivek Sarin, Weiping Shi