2060 search results - page 52 / 412 » Some Applications of Coding Theory in Computational Complexi... |
123
click to vote
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
146
click to vote
AAI
2006
15 years 4 months ago
2006
Enabling and managing coordination activities between autonomous, possibly mobile, computing entities in dynamic computing scenarios challenges traditional approaches to distribut...
137
click to vote
SIGACT
2008
15 years 3 months ago
2008
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
153
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Mapping biology into computation has both a domain specific aspect – biological theory – and a methodological aspect – model development. Computational modelers have implici...
137
click to vote
ICIP
1997
IEEE
15 years 8 months ago
1997
IEEE
This is a contribution for very low bit rate video coding in real-time and software only on computers of PC class. It is based on frame replenishment with block coding using mean-...