2060 search results - page 266 / 412 » Some Applications of Coding Theory in Computational Complexi... |
128
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
154
click to vote
IJET
2007
15 years 4 months ago
2007
Remarkable advances in instructional communication technology (ICT) have now made is possible to provide high levels of enrichment and the kinds of curricular differentiation that...
122
click to vote
TRIDENTCOM
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper describes the motivation, methodology and implementation approach of the testbed that has been developed in the framework of the EVEREST project. Such testbed is used f...
122
click to vote
POLICY
2005
Springer
15 years 10 months ago
2005
Springer
The use of policy-based mechanisms significantly reduces the complexity associated with applicational development and operation. In particular, history-based policies allow the s...
123
Voted
FIDJI
2003
Springer
15 years 9 months ago
2003
Springer
– This paper presents a Java service platform for mobile healthcare that enables remote health monitoring using 2.5/3G public wireless networks. The platform complies with today...