Sciweavers

1403 search results - page 74 / 281
» About Approximations of Exponentials
Sort
View
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
16 years 1 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
STOC
2012
ACM
209views Algorithms» more  STOC 2012»
13 years 3 months ago
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
Anindya De, Ilias Diakonikolas, Vitaly Feldman, Ro...
94
Voted
RC
2002
70views more  RC 2002»
15 years 13 days ago
On Existence and Uniqueness Verification for Non-Smooth Functions
Given an approximate solution to a nonlinear system of equations at which the Jacobi matrix is nonsingular, and given that the Jacobi matrix is continuous in a region about this ap...
R. Baker Kearfott
122
Voted
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
15 years 2 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
JCO
2008
76views more  JCO 2008»
15 years 23 days ago
On the inapproximability of the exemplar conserved interval distance problem of genomes
In this paper we present two main results about the inapproximability of the exemplar conserved interval distance problem of genomes. First, we prove that it is NP-complete to deci...
Zhixiang Chen, Richard H. Fowler, Bin Fu, Binhai Z...