28 search results - page 4 / 6 » Compact linearization for binary quadratic problems |
WEA
2010
Springer
14 years 2 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
CSCLP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
TSP
2010
13 years 2 months ago
2010
Consider the problem of signal detection via multiple distributed noisy sensors. We propose a linear decision fusion rule to combine the local statistics from individual sensors i...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
PAA
2008
13 years 7 months ago
2008
This paper proposes a method of finding a discriminative linear transformation that enhances the data's degree of conformance to the compactness hypothesis and its inverse. Th...