4860 search results - page 525 / 972 » SNPs Problems, Complexity, and Algorithms |
139
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
145
Voted
VLSID
1998
IEEE
15 years 8 months ago
1998
IEEE
With several commercial tools becoming available, the high-level synthesis of applicationspeci c integrated circuits is nding wide spread acceptance in VLSI industry today. Existi...
134
click to vote
ECCC
2006
15 years 4 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
115
Voted
ICPR
2002
IEEE
16 years 5 months ago
2002
IEEE
We present a fast non-iterative method for approximating the leading eigenvector so as to render graph-spectral based grouping algorithms more efficient. The approximation is base...
122
click to vote
ICCD
2001
IEEE
16 years 1 months ago
2001
IEEE
Clock distribution has traditionally been a circuit design problem with negligible micro-architectural impact. However, for clock distribution networks using multiple phase-locked...