607 search results - page 4 / 122 » Unifying Exact Completions |
VTC
2006
IEEE
15 years 4 months ago
2006
IEEE
—In this paper, by using the moment generating function (MGF) method, we derived the exact symbol error rate (SER) of multiple-input multiple-output (MIMO) system with transmit-a...
ISMVL
2007
IEEE
15 years 4 months ago
2007
IEEE
We define a resolution-style rule for solving the Max-SAT problem of Signed CNF formulas (Signed Max-SAT) and prove that our rule provides a complete calculus for that problem. F...
IWANN
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. This paper proposes a novel algorithm for complete exact patternmatching focusing the specificities of protein sequences (alphabet of 20 symbols) but, also highly efficie...
ECCV
2010
Springer
14 years 11 months ago
2010
Springer
The saddle point framework provides a convenient way to formulate many convex variational problems that occur in computer vision. The framework unifies a broad range of data and re...
DM
2008
14 years 10 months ago
2008
A nonincreasing sequence of nonnegative integers = (d1, d2, ..., dn) is graphic if there is a (simple) graph G of order n having degree sequence . In this case, G is said to reali...