1941 search results - page 120 / 389 » On the Hardness of Approximate Reasoning |
182
click to vote
ALGORITHMICA
2004
15 years 6 months ago
2004
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...
153
click to vote
TIT
2002
15 years 6 months ago
2002
We present a framework for iterative multiuser joint decoding of code-division multiple-access (CDMA) signals, based on the factor-graph representation and on the sum-product algor...
169
click to vote
NETWORKS
2007
15 years 5 months ago
2007
This paper defines an incremental version of the maximum flow problem. In this model, the capacities increase over time and the resulting solution is a sequence of flows that b...
179
click to vote
BMVC
2010
15 years 4 months ago
2010
We present an approach for active segmentation based on integration of several cues. It serves as a framework for generation of object hypotheses of previously unseen objects in n...
114
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Unit selection synthesis inventories have coverage issues, which lead to missing syllable or diphone units. In the conventional back-off strategy of substituting the missing unit ...