Sciweavers

1802 search results - page 69 / 361
» Sparse Computations with PEI
Sort
View
ACIVS
2005
Springer
15 years 3 months ago
Image De-Quantizing via Enforcing Sparseness in Overcomplete Representations
We describe a method for removing quantization artifacts (de-quantizing) in the image domain, by enforcing a high degree of sparseness in its representation with an overcomplete or...
Luis Mancera, Javier Portilla
CPM
2005
Springer
97views Combinatorics» more  CPM 2005»
15 years 3 months ago
On the Complexity of Sparse Exon Assembly
Gene structure prediction is one of the most important problems in computational molecular biology. It involves two steps: the first is finding the evidence (e.g. predicting spl...
Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson
DIS
2000
Springer
15 years 2 months ago
Combination Retrieval for Creating Knowledge from Sparse Document Collection
With the variety of human life, people are interested in various matters for each one’s unique reason, for which a machine maybe a better counselor than a human. This paper prop...
Naohiro Matsumura, Yukio Ohsawa
PVM
1999
Springer
15 years 2 months ago
Parallel Monte Carlo Algorithms for Sparse SLAE Using MPI
The problem of solving sparse Systems of Linear Algebraic Equations (SLAE) by parallel Monte Carlo numerical methods is considered. The almost optimal Monte Carlo algorithms are pr...
Vassil N. Alexandrov, Aneta Karaivanova
CLOR
2006
15 years 1 months ago
A Sparse Object Category Model for Efficient Learning and Complete Recognition
We present a "parts and structure" model for object category recognition that can be learnt efficiently and in a weakly-supervised manner: the model is learnt from examp...
Robert Fergus, Pietro Perona, Andrew Zisserman