2924 search results - page 234 / 585 » Lower Bounds in Distributed Computing |
115
click to vote
ACCV
2007
Springer
15 years 10 months ago
2007
Springer
Strong temporal correlation between adjacent frames of a video signal has been successfully exploited in standard video compression algorithms. In this work, we show that the tempo...
157
Voted
DCC
2011
IEEE
14 years 11 months ago
2011
IEEE
For odd integer m ≥ 3 and t = 0, 1, . . . , m−1 2 , we define Family V (t) to be a set of size 2m(t+1) containing binary sequences of period 2m+1 − 2. The nontrivial correl...
135
click to vote
SPDP
1991
IEEE
15 years 7 months ago
1991
IEEE
This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model...
110
click to vote
HPDC
2003
IEEE
15 years 9 months ago
2003
IEEE
The ability to efficiently discover information using partial knowledge (for example keywords, attributes or ranges) is important in large, decentralized, resource sharing distri...
143
click to vote
TCS
2011
14 years 11 months ago
2011
The PAC-learning model is distribution-independent in the sense that the learner must reach a learning goal with a limited number of labeled random examples without any prior know...