Sciweavers

358 search results - page 29 / 72
» Sparse squares of polynomials
Sort
View
SODA
2012
ACM
170views Algorithms» more  SODA 2012»
11 years 11 months ago
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
Stefan Kratsch, Magnus Wahlström
ISMVL
2006
IEEE
117views Hardware» more  ISMVL 2006»
14 years 3 months ago
Representations of Elementary Functions Using Binary Moment Diagrams
This paper considers representations for elementary functions such as polynomial, trigonometric, logarithmic, square root, and reciprocal functions. These real valued functions ar...
Tsutomu Sasao, Shinobu Nagayama
SIAMNUM
2010
99views more  SIAMNUM 2010»
13 years 3 months ago
On the Fourier Extension of Nonperiodic Functions
We obtain exponentially accurate Fourier series for nonperiodic functions on the interval [-1, 1] by extending these functions to periodic functions on a larger domain. The series ...
Daan Huybrechs
IPL
2008
98views more  IPL 2008»
13 years 9 months ago
On the number of Go positions on lattice graphs
We use transfer matrix methods to determine bounds for the numbers of legal Go positions for various numbers of players on some planar lattice graphs, including square lattice gra...
Graham Farr, Johannes Schmidt
ICASSP
2010
IEEE
13 years 9 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...