Sciweavers

616 search results - page 2 / 124
» Decoding One Out of Many
Sort
View
IPPS
1997
IEEE
13 years 9 months ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen
AIPS
2008
13 years 7 months ago
From One to Many: Planning for Loosely Coupled Multi-Agent Systems
Loosely coupled multi-agent systems are perceived as easier to plan for because they require less coordination between agent sub-plans. In this paper we set out to formalize this ...
Ronen I. Brafman, Carmel Domshlak
SPW
2004
Springer
13 years 10 months ago
One User, Many Hats; and, Sometimes, No Hat: Towards a Secure Yet Usable PDA
How can we design a PDA that is at the same time secure and usable? In current implementations the two properties are mutually exclusive. Because normal users find password entry ...
Frank Stajano
MTPP
2010
13 years 21 hour ago
Parallelization of Motion JPEG Decoder on TILE64 Many-Core Platform
The ubiquity of many-core architectures poses challenges to software developers to make scalable software. To parallelize data-intensive applications on a many-core platform, one h...
Xuan-Yi Lin, Chung-Yu Huang, Pei-Man Yang, Tai-Wen...
CORR
2008
Springer
117views Education» more  CORR 2008»
13 years 3 months ago
Complexity of Decoding Positive-Rate Reed-Solomon Codes
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
Qi Cheng, Daqing Wan