Sciweavers

96 search results - page 16 / 20
» Efficient Mapping of Addition Recurrence Algorithms in CMOS
Sort
View
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
13 years 10 months ago
Node Mergers in the Presence of Don't Cares
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
Stephen Plaza, Kai-Hui Chang, Igor L. Markov, Vale...

Publication
353views
14 years 5 months ago
Shape from Shading with Perspective Projection
Most conventional SFS (shape from shading) algorithms have been developed under the assumption of orthographic projection. However, the assumption is not valid when an object is no...
Kyoung Mu Lee (Seoul National University), C.-C. J...
ICPR
2004
IEEE
14 years 7 months ago
Using Multiple Graphics Cards as a General Purpose Parallel Computer : Applications to Computer Vision
Pattern recognition and computer vision tasks are computationally intensive, repetitive, and often exceed the capabilities of the CPU, leaving little time for higher level tasks. ...
James Fung, Steve Mann
IJCNLP
2004
Springer
14 years 3 days ago
Phoneme-Based Transliteration of Foreign Names for OOV Problem
One problem seriously affecting CLIR performance is the processing of queries with embedded foreign names. A proper noun dictionary is never complete rendering name translation fr...
Wei Gao, Kam-Fai Wong, Wai Lam
SPIEVIP
2010
13 years 9 months ago
Unconstrained license plate detection using the Hausdorff distance
This paper reports on a new technique for unconstrained license plate detection in a surveillance context. The proposed algorithm quickly finds license plates by performing the fo...
Marc Lalonde, Samuel Foucher, Langis Gagnon