2994 search results - page 411 / 599 » Time sequences |
161
click to vote
MST
2010
15 years 1 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
167
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
The problem of dynamical tomography consists in reconstructing a temporal sequence of images from their noisy projections. For this purpose, a recursive algorithm is usually used,...
208
click to vote
WIOPT
2011
IEEE
14 years 10 months ago
2011
IEEE
—We consider the minimization of the transmission completion time with a battery limited energy harvesting transmitter in a two-user AWGN broadcast channel. The transmitter has ï...
165
click to vote
CISS
2011
IEEE
14 years 10 months ago
2011
IEEE
— We present a hardware-accelerated implementation of a bottom-up visual attention algorithm. This algorithm generates a multi-scale saliency map from differences in image intens...
200
click to vote
CONSTRAINTS
2011
14 years 10 months ago
2011
Abstract. We consider the problem of decomposing an integer matrix into a positively weighted sum of binary matrices that have the consecutive-ones property. This problem is well-k...