Sciweavers

9842 search results - page 1866 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
VIS
2004
IEEE
135views Visualization» more  VIS 2004»
14 years 11 months ago
Adaptive 4-8 Texture Hierarchies
We address the texture level-of-detail problem for extremely large surfaces such as terrain during realtime, view-dependent rendering. A novel texture hierarchy is introduced base...
Kenneth I. Joy, Lok M. Hwa, Mark A. Duchaineau
ICPR
2004
IEEE
14 years 11 months ago
Discriminative Distance Measures for Image Matching
: Significant progress has been made by the computer vision community in recent years along two fronts: (i) developing complex spatial-temporal models for object registration and t...
Tat-Jen Cham, Xi Chen
DAC
2009
ACM
14 years 11 months ago
Multicore parallel min-cost flow algorithm for CAD applications
Computational complexity has been the primary challenge of many VLSI CAD applications. The emerging multicore and manycore microprocessors have the potential to offer scalable perf...
Yinghai Lu, Hai Zhou, Li Shang, Xuan Zeng
DAC
2007
ACM
14 years 11 months ago
Progressive Decomposition: A Heuristic to Structure Arithmetic Circuits
Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open problem and largely unsolved. In mos...
Ajay K. Verma, Philip Brisk, Paolo Ienne
DAC
2003
ACM
14 years 11 months ago
A cost-driven lithographic correction methodology based on off-the-shelf sizing tools
As minimum feature sizes continue to shrink, patterned features have become significantly smaller than the wavelength of light used in optical lithography. As a result, the requir...
Puneet Gupta, Andrew B. Kahng, Dennis Sylvester, J...
« Prev « First page 1866 / 1969 Last » Next »