1469 search results - page 176 / 294 » Approximate polynomial decomposition |
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...
158
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
We demonstrate that the unbounded fan-out gate is very powerful. Constant-depth polynomial-size quantum circuits with bounded fan-in and unbounded fan-out over a fixed basis (denot...
169
click to vote
NETWORKS
2007
15 years 6 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...
178
click to vote
TSMC
2010
15 years 1 months ago
2010
The human visual system obeys Listing's law, which means that the cyclorotation of the eye (around the line of sight) can be predicted from the direction of the fixation point...
245
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, we describe a minimal mean square error (MMSE) optimal interpolation filter for discrete random signals. We explicitly derive the interpolation filter for a firs...