Sciweavers

1092 search results - page 41 / 219
» Polynomial Interpretations and the Complexity of Algorithms
Sort
View
ICASSP
2011
IEEE
14 years 3 months ago
Fast algorithms for Iterative Adaptive Approach spectral estimation techniques
This paper presents computationally efficient implementations for Iterative Adaptive Approach (IAA) spectral estimation techniques for uniformly sampled data sets. By exploiting ...
George-Othon Glentis, Andreas Jakobsson
BMCBI
2007
144views more  BMCBI 2007»
14 years 11 months ago
Accelerated search for biomolecular network models to interpret high-throughput experimental data
Background: The functions of human cells are carried out by biomolecular networks, which include proteins, genes, and regulatory sites within DNA that encode and control protein e...
Suman Datta, Bahrad A. Sokhansanj
DISOPT
2007
81views more  DISOPT 2007»
14 years 11 months ago
Strong polynomiality of resource constraint propagation
Constraint-based schedulers have been widely successful to tackle complex, disjunctive and cumulative, scheduling applications by combining tree search and constraint propagation....
Luc Mercier, Pascal Van Hentenryck
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
16 years 2 days ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
ISAAC
2003
Springer
141views Algorithms» more  ISAAC 2003»
15 years 5 months ago
Quasi-optimal Arithmetic for Quaternion Polynomials
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
Martin Ziegler