3110 search results - page 283 / 622 » On the initialization of the DNMF algorithm |
145
click to vote
STOC
1993
ACM
15 years 10 months ago
1993
ACM
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
184
click to vote
DAWAK
2007
Springer
15 years 10 months ago
2007
Springer
Most methods for temporal pattern mining assume that time is represented by points in a straight line starting at some initial instant. In this paper, we consider a new kind of fir...
152
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
—In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings RK . It was previously known that PSPACE, and hence BPP is Turingreducible to RK ...
195
click to vote
ACIVS
2006
Springer
15 years 10 months ago
2006
Springer
Disparity estimation can be used to eliminate redundancy among different views in multi-view video compression to obtain high compression efficiency. However, the problem of high c...
176
click to vote
ANTSW
2006
Springer
15 years 10 months ago
2006
Springer
It is often believed that the performance of ant system, and in general of ant colony optimization algorithms, depends somehow on the scale of the problem instance at hand. The iss...