203 search results - page 15 / 41 » Incremental computation of planar maps |
ICCAD
2004
IEEE
15 years 8 months ago
2004
IEEE
— This paper presents Hermes, a depth-optimal LUT based FPGA mapping algorithm. The presented algorithm is based on a new strategy for finding LUTs allowing to find a good LUT ...
107
click to vote
SIGGRAPH
2010
ACM
15 years 4 months ago
2010
ACM
Painters and illustrators commonly sketch vanishing points and lines to guide the construction of perspective images. We present a tool that gives users the ability to manipulate ...
105
click to vote
WACV
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper presents an new framework for homographybased analysis of pedestrian-vehicle activity in crowded scenes. Planar homography constraint is exploited to extract view-invar...
112
click to vote
ICDM
2006
IEEE
15 years 5 months ago
2006
IEEE
Existing studies for mining frequent XML query patterns mainly introduce a straightforward candidate generate-and-test strategy and compute frequencies of candidate query patterns...
111
click to vote
EGH
2007
Springer
15 years 6 months ago
2007
Springer
Logarithmic shadow maps can deliver the same quality as competing shadow map algorithms with substantially less storage and bandwidth. We show how current GPU architectures can be...