4860 search results - page 439 / 972 » SNPs Problems, Complexity, and Algorithms |
143
click to vote
ESA
2006
Springer
15 years 7 months ago
2006
Springer
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...
134
click to vote
DICTA
2003
15 years 5 months ago
2003
In this paper we review a number of approaches to reducing, or removing, the problem of shift variance in the discrete wavelet transform (DWT). We describe a generalization of the ...
118
click to vote
FLAIRS
1998
15 years 5 months ago
1998
The increasing number of knowledge-based systems that build on a Bayesian belief network or influence diagram acknowledge the usefulness of these frameworks for addressing complex...
136
click to vote
ENDM
2008
15 years 4 months ago
2008
We study the problem of, given two sequences x and y over a finite alphabet, finding a repetitionfree longest common subsequence of x and y. We show several algorithmic results, a...
131
click to vote
INTEGRATION
2008
15 years 3 months ago
2008
In this paper an efficient algorithm for the synthesis and exact minimization of ESCT(Exclusive or Sum of Complex Terms) expressions for Boolean functions of at most six variables...