Sciweavers

21324 search results - page 143 / 4265
» Making the case for computing
Sort
View
CORR
2011
Springer
188views Education» more  CORR 2011»
15 years 1 months ago
On the Decoding Complexity of Cyclic Codes Up to the BCH Bound
—The standard algebraic decoding algorithm of cyclic codes [n, k, d] up to the BCH bound t is very efficient and practical for relatively small n while it becomes unpractical fo...
Davide Schipani, Michele Elia, Joachim Rosenthal
UAI
2001
15 years 7 months ago
Similarity Measures on Preference Structures, Part II: Utility Functions
In previous work [8] we presented a casebased approach to eliciting and reasoning with preferences. A key issue in this approach is the definition of similarity between user prefe...
Vu A. Ha, Peter Haddawy, John Miyamoto
PERCOM
2010
ACM
15 years 4 months ago
A flexible context stabilization approach for self-adaptive application
Abstract—Pervasive applications are characterized by variations in their context of execution. Their correct behavior requires continuous adaptations, accordingly to changes obse...
Russel Nzekwa, Romain Rouvoy, Lionel Seinturier