1688 search results - page 42 / 338 » The Complexity of Rationalizing Matchings |
IAT
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...
CIE
2006
Springer
14 years 21 days ago
2006
Springer
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
AAAI
2007
13 years 11 months ago
2007
We study the behavior of the classical A∗ search algorithm when coupled with a heuristic that provides estimates, accurate to within a small multiplicative factor, of the distan...
TSP
2008
13 years 8 months ago
2008
We introduce a framework based on Wirtinger calculus for nonlinear complex-valued signal processing such that all computations can be directly carried out in the complex domain. Th...
ICMCS
2006
IEEE
14 years 3 months ago
2006
IEEE
A high-efficiency video coding method using matching pursuits, which is a waveform coding technique, has recently been proposed. In this method, the motion compensated prediction...