1213 search results - page 59 / 243 » Approximation in quantale-enriched categories |
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
We address the problem of finding deformation between two images for the purpose of recognizing objects. The challenge is that discriminative features are often transformation-va...
102
click to vote
BMCBI
2004
14 years 10 months ago
2004
Background: Ranked gene lists from microarray experiments are usually analysed by assigning significance to predefined gene categories, e.g., based on functional annotations. Tool...
ISSAC
2007
Springer
15 years 4 months 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 ...
STOC
2006
ACM
15 years 4 months ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
ISSAC
2004
Springer
15 years 3 months ago
2004
Springer
We give a necessary and sufficient condition for an algebraic ODE to have a rational type general solution. For an autonomous first order ODE, we give an algorithm to compute a r...