Sciweavers

279 search results - page 12 / 56
» Computing numerically with functions instead of numbers
Sort
View
ICIP
1999
IEEE
14 years 9 months ago
A Fast Algorithm for Rigid Structure from Image Sequences
The factorization method [1] is a feature-based approach to recover 3D rigid structure from motion. In [2], we extended their framework to recover a parametric description of the ...
Pedro M. Q. Aguiar, José M. F. Moura
POPL
2009
ACM
14 years 8 months ago
SPEED: precise and efficient static estimation of program computational complexity
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...
JACM
2000
119views more  JACM 2000»
13 years 7 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Bernard Chazelle
BMCBI
2008
130views more  BMCBI 2008»
13 years 7 months ago
Function approximation approach to the inference of reduced NGnet models of genetic networks
Background: The inference of a genetic network is a problem in which mutual interactions among genes are deduced using time-series of gene expression patterns. While a number of m...
Shuhei Kimura, Katsuki Sonoda, Soichiro Yamane, Hi...
ICA
2010
Springer
13 years 8 months ago
Binary Sparse Coding
We study a sparse coding learning algorithm that allows for a simultaneous learning of the data sparseness and the basis functions. The algorithm is derived based on a generative m...
Marc Henniges, Gervasio Puertas, Jörg Bornsch...