467 search results - page 62 / 94 » The Complexity of Polynomials and Their Coefficient Function... |
ICCAD
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...
127
click to vote
BICOB
2009
Springer
14 years 9 months ago
2009
Springer
We propose a two-step biclustering approach to mine co-regulation patterns of a given reference gene to discover other genes that function in a common biological process. Currently...
STOC
2002
ACM
16 years 2 days ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
FLAIRS
2006
15 years 1 months ago
2006
Sensitivity analysis of Markovian models amounts to computing the constants in polynomial functions of a parameter under study. To handle the computational complexity involved, we...