1054 search results - page 81 / 211 » Capacitated Domination Problem |
136
click to vote
SIAMCOMP
2010
14 years 9 months ago
2010
We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are W[1]-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers,...
112
click to vote
DATE
2005
IEEE
15 years 8 months ago
2005
IEEE
A comprehensive probabilistic methodology is proposed to solve the buffer insertion problem with the consideration of process variations. In contrast to a recent work, we point o...
115
click to vote
ICCAD
1997
IEEE
15 years 7 months ago
1997
IEEE
† This paper describes a novel methodology to automate the design of the interconnect distribution for multistage clock circuits. We introduce two key ideas. First, a hierarchica...
111
click to vote
NIPS
1998
15 years 4 months ago
1998
Training a Support Vector Machine (SVM) requires the solution of a very large quadratic programming (QP) problem. This paper proposes an algorithm for training SVMs: Sequential Mi...
125
click to vote
ICIP
2004
IEEE
16 years 4 months ago
2004
IEEE
The goal of this work is to find a fast method for motion estimation and motion segmentation. We chose to decompose the motion on a basis functions. That allows us to compute the ...