Sciweavers

3251 search results - page 373 / 651
» On a vector q-d algorithm
Sort
View
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
16 years 5 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
RECSYS
2009
ACM
15 years 11 months ago
Recommending new movies: even a few ratings are more valuable than metadata
In the Netflix Prize competition many new collaborative filtering (CF) approaches emerged, which are excellent in optimizing the RMSE of the predictions. Matrix factorization (M...
István Pilászy, Domonkos Tikk
CSB
2005
IEEE
146views Bioinformatics» more  CSB 2005»
15 years 10 months ago
Multi-Metric and Multi-Substructure Biclustering Analysis for Gene Expression Data
A good number of biclustering algorithms have been proposed for grouping gene expression data. Many of them have adopted matrix norms to define the similarity score of a bicluste...
Sun-Yuan Kung, Man-Wai Mak, Ilias Tagkopoulos
GRAPHITE
2007
ACM
15 years 8 months ago
Compact and efficient generation of radiance transfer for dynamically articulated characters
We present a data-driven technique for generating the precomputed radiance transfer vectors of an animated character as a function of its joint angles. We learn a linear model for...
Derek Nowrouzezahrai, Patricio D. Simari, Evangelo...
146
Voted
COCO
2004
Springer
147views Algorithms» more  COCO 2004»
15 years 8 months ago
The Complexity of the Covering Radius Problem on Lattices and Codes
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
Venkatesan Guruswami, Daniele Micciancio, Oded Reg...