Sciweavers

963 search results - page 64 / 193
» On the decomposition of rational functions
Sort
View
SIAMDM
2008
139views more  SIAMDM 2008»
13 years 8 months ago
Approximate Integer Decompositions for Undirected Network Design Problems
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
Chandra Chekuri, F. Bruce Shepherd
ICASSP
2011
IEEE
13 years 15 days ago
Decomposition of speech signals for analysis of aperiodic components of excitation
The motivation for this study is the need for careful analysis of aperiodicity of the excitation component in expressive voices. The paper proposes analysis methods which can pres...
Bayya Yegnanarayana, Anand Joseph Xavier Medabalim...
ICASSP
2011
IEEE
13 years 15 days ago
Sparse decomposition of transformation-invariant signals with continuous basis pursuit
Consider the decomposition of a signal into features that undergo transformations drawn from a continuous family. Current methods discretely sample the transformations and apply s...
Chaitanya Ekanadham, Daniel Tranchina, Eero P. Sim...
CCL
1994
Springer
14 years 26 days ago
How to Win a Game with Features
We employ the model-theoretic method of Ehrenfeucht-Fra sse Games to prove the completeness of the theory CFT, which has been introduced in 22] for describing rational trees in a ...
Rolf Backofen, Ralf Treinen
IJFCS
2008
121views more  IJFCS 2008»
13 years 8 months ago
Reachability Problems in Low-Dimensional Iterative Maps
In this paper we analyse the dynamics of one-dimensional piecewise maps (PAMs). We show that one-dimensional PAMs are equivalent to pseudo-billiard or so called "strange billi...
Oleksiy Kurganskyy, Igor Potapov, Fernando Sancho-...