1469 search results - page 169 / 294 » Approximate polynomial decomposition |
140
click to vote
ISSAC
2007
Springer
16 years 12 days ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
259
click to vote
CPM
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. This paper addresses the problem of aligning multiple sequences of non-coding RNA genes. We approach this problem with the biologically motivated paradigm that scoring of...
193
click to vote
ICGI
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We report here a number of results concerning the learnability of th...
151
click to vote
FOCS
1992
IEEE
15 years 10 months ago
1992
IEEE
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilisticall...
170
click to vote
ASPDAC
2008
ACM
15 years 8 months ago
2008
ACM
Abstract-- We address performance maximization of independent task sets under energy constraint on chip multi-processor (CMP) architectures that support multiple voltage/frequency ...