279 search results - page 38 / 56 » Matching Polynomials And Duality |
LATIN
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
STOC
2000
ACM
15 years 3 months ago
2000
ACM
We give efficient (polynomial-time) list-decoding algorithms for certain families of errorcorrecting codes obtained by "concatenation". Specifically, we give list-decodi...
101
click to vote
ECML
2006
Springer
15 years 1 months ago
2006
Springer
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
ICMCS
2010
IEEE
15 years 26 days ago
2010
IEEE
According to a popular pattern recognition method, this paper proposes two methods to generate a secret from individual's biometric information, such as fingerprint feature p...
117
click to vote
DISOPT
2010
14 years 12 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...