Sciweavers

756 search results - page 44 / 152
» Quantization of Sparse Representations
Sort
View
CVPR
2011
IEEE
12 years 11 months ago
Robust Tracking Using Local Sparse Appearance Model and K-Selection
Online learned tracking is widely used for it’s adaptive ability to handle appearance changes. However, it introduces potential drifting problems due to the accumulation of erro...
Baiyang Liu, junzhou Huang, Casimir Kulikowski, Li...
ACL
2010
13 years 5 months ago
Tackling Sparse Data Issue in Machine Translation Evaluation
We illustrate and explain problems of n-grams-based machine translation (MT) metrics (e.g. BLEU) when applied to morphologically rich languages such as Czech. A novel metric SemPO...
Ondrej Bojar, Kamil Kos, David Marecek
APPROX
2009
Springer
136views Algorithms» more  APPROX 2009»
14 years 2 months ago
Succinct Representation of Codes with Applications to Testing
Motivated by questions in property testing, we search for linear error-correcting codes that have the “single local orbit” property: i.e., they are specified by a single loca...
Elena Grigorescu, Tali Kaufman, Madhu Sudan
ICASSP
2010
IEEE
13 years 8 months ago
Parametric dictionary learning using steepest descent
In this paper, we suggest to use a steepest descent algorithm for learning a parametric dictionary in which the structure or atom functions are known in advance. The structure of ...
Mahdi Ataee, Hadi Zayyani, Massoud Babaie-Zadeh, C...
CORR
2011
Springer
199views Education» more  CORR 2011»
13 years 2 months ago
Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining
Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...
Xintian Yang, Srinivasan Parthasarathy, Ponnuswamy...