1688 search results - page 42 / 338 » The Complexity of Rationalizing Matchings |
136
click to vote
IAT
2009
IEEE
16 years 9 days 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/...
178
click to vote
CIE
2006
Springer
15 years 9 months 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...
132
click to vote
AAAI
2007
15 years 7 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...
236
click to vote
TSP
2008
15 years 5 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...
165
click to vote
ICMCS
2006
IEEE
15 years 11 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...