17760 search results - page 181 / 3552 » A Generalization of the Massey-Ding Algorithm |
139
Voted
SAT
2004
Springer
15 years 9 months ago
2004
Springer
2QBF is the problem of evaluating a Quantified Boolean Formula (QBF) with two levels of quantification. Many practical problems in sequential verification can be formulated as i...
139
click to vote
STACS
1999
Springer
15 years 8 months ago
1999
Springer
Quantum algorithms for factoring and finding discrete logarithms have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the ...
151
click to vote
CATS
2006
15 years 5 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
196
click to vote
PAMI
2012
13 years 6 months ago
2012
Abstract—We consider two desired properties of learning algorithms: sparsity and algorithmic stability. Both properties are believed to lead to good generalization ability. We sh...
131
click to vote
DLOG
2006
15 years 5 months ago
2006
A variety of fuzzy description logics are proposed to extend classical description logics with fuzzy capability. However, reasoning with general TBoxes is still an open problem in...