Sciweavers

8 search results - page 1 / 2
» Matching Problems in Polymatroids Without Double Circuits
Sort
View
IPCO
2007
81views Optimization» more  IPCO 2007»
13 years 8 months ago
Matching Problems in Polymatroids Without Double Circuits
According to the present state of the theory of the matroid matching problem, the existence of a good characterization to the size of a maximum matching depends on the behavior of ...
Márton Makai, Gyula Pap, Jácint Szab...
ISPD
2010
ACM
249views Hardware» more  ISPD 2010»
14 years 2 months ago
A matching based decomposer for double patterning lithography
Double Patterning Lithography (DPL) is one of the few hopeful candidate solutions for the lithography for CMOS process beyond 45nm. DPL assigns the patterns less than a certain di...
Yue Xu, Chris Chu
DAC
2011
ACM
12 years 7 months ago
Efficient incremental analysis of on-chip power grid via sparse approximation
In this paper, a new sparse approximation technique is proposed for incremental power grid analysis. Our proposed method is motivated by the observation that when a power grid net...
Pei Sun, Xin Li, Ming Yuan Ting
PAMI
2008
147views more  PAMI 2008»
13 years 7 months ago
Image Stitching Using Structure Deformation
The aim of this paper is to achieve seamless image stitching without producing visual artifact caused by severe intensity discrepancy and structure misalignment, given that the inp...
Jiaya Jia, Chi-Keung Tang
TVLSI
2010
13 years 2 months ago
Test Data Compression Using Efficient Bitmask and Dictionary Selection Methods
Abstract--Higher circuit densities in system-on-chip (SOC) designs have led to drastic increase in test data volume. Larger test data size demands not only higher memory requiremen...
Kanad Basu, Prabhat Mishra