Sciweavers

3575 search results - page 388 / 715
» Presentations of computably enumerable reals
Sort
View
PAMI
2010
146views more  PAMI 2010»
15 years 5 months ago
A Generalized Kernel Consensus-Based Robust Estimator
In this paper, we present a new Adaptive Scale Kernel Consensus (ASKC) robust estimator as a generalization of the popular and state-of-the-art robust estimators such as RANSAC (R...
Hanzi Wang, Daniel Mirota, Gregory D. Hager
DASFAA
2009
IEEE
136views Database» more  DASFAA 2009»
16 years 1 months ago
A Two-Tire Index Structure for Approximate String Matching with Block Moves
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
Bin Wang, Long Xie, Guoren Wang
CORR
2011
Springer
157views Education» more  CORR 2011»
15 years 1 months ago
Fast and Faster: A Comparison of Two Streamed Matrix Decomposition Algorithms
With the explosion of the size of digital dataset, the limiting factor for decomposition algorithms is the number of passes over the input, as the input is often stored out-of-cor...
Radim Rehurek
CORR
2011
Springer
199views Education» more  CORR 2011»
15 years 1 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...
INTERSPEECH
2010
15 years 1 months ago
Convexity and fast speech extraction by split bregman method
A fast speech extraction (FSE) method is presented using convex optimization made possible by pause detection of the speech sources. Sparse unmixing filters are sought by l1 regul...
Meng Yu, Wenye Ma, Jack Xin, Stanley Osher