Sciweavers

1695 search results - page 136 / 339
» Linear, Polynomial or Exponential
Sort
View
DISOPT
2008
78views more  DISOPT 2008»
15 years 4 months ago
N-fold integer programming
In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed n-fold integer programming problems are polynomial time ...
Jesús A. De Loera, Raymond Hemmecke, Shmuel...
INFORMATICALT
2008
97views more  INFORMATICALT 2008»
15 years 4 months ago
On the Use of the Formant Features in the Dynamic Time Warping Based Recognition of Isolated Words
Abstract. A possibility to use the formant features (FF) in the user-dependent isolated word recognition has been investigated. The word recognition was performed using a dynamic t...
Antanas Lipeika, Joana Lipeikiene
127
Voted
ECCC
1998
117views more  ECCC 1998»
15 years 4 months ago
Determinant: Old Algorithms, New Insights
In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of...
Meena Mahajan, V. Vinay
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
16 years 2 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
JACIII
2007
99views more  JACIII 2007»
15 years 4 months ago
Asymptotic Behavior of Linear Approximations of Pseudo-Boolean Functions
We study the problem of approximating pseudoBoolean functions by linear pseudo-Boolean functions. Pseudo-Boolean functions generalize ordinary Boolean functions by allowing the fu...
Guoli Ding, Robert F. Lax, Peter P. Chen, Jianhua ...