6740 search results - page 350 / 1348 » An s -Hamiltonian Line Graph Problem |
133
click to vote
COLING
2008
15 years 5 months ago
2008
This paper describes a parameter estimation method for multi-label classification that does not rely on approximate inference. It is known that multi-label classification involvin...
145
click to vote
DAM
2010
15 years 3 months ago
2010
We consider the problem of sorting a permutation using a network of data structures as introduced by Knuth and Tarjan. In general the model as considered previously was restricted...
124
click to vote
TAMC
2009
Springer
15 years 11 months ago
2009
Springer
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set pr...
123
click to vote
ISSS
1997
IEEE
15 years 8 months ago
1997
IEEE
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases . There exists some tools that give an o...
138
click to vote
SIROCCO
2010
15 years 5 months ago
2010
Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...