2127 search results - page 135 / 426 » Computing large matchings fast |
129
click to vote
CGI
2004
IEEE
15 years 7 months ago
2004
IEEE
Rendering geometric models with complex surface materials in arbitrary lighting environments is a challenging problem. In order to relight and render geometries covered with compl...
101
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Recently, a new method for encoding data sets in the form of "Density Codes" was proposed in the literature (Courrieu, 2006). This method allows to compare sets of points...
209
click to vote
SIGCOMM
2006
ACM
15 years 10 months ago
2006
ACM
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most...
142
click to vote
CVPR
2003
IEEE
16 years 6 months ago
2003
IEEE
We describe some techniques that can be used to represent and detect deformable shapes in images. The main difficulty with deformable template models is the very large or infinite...
187
click to vote
CAMP
2005
IEEE
15 years 9 months ago
2005
IEEE
— This paper describes the mapping of a recently introduced template matching algorithm based on the Normalized Cross Correlation (NCC) on a general purpose processor endowed wit...