484 search results - page 87 / 97 » Computing Hilbert Class Polynomials |
111
click to vote
STOC
2010
ACM
15 years 6 months ago
2010
ACM
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
130
Voted
CSR
2008
Springer
15 years 1 months ago
2008
Springer
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
199
Voted
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
Abstract-- Current state-of-the-art association rule-based classifiers for gene expression data operate in two phases: (i) Association rule mining from training data followed by (i...
117
click to vote
PODC
2009
ACM
16 years 2 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
150
Voted
COCO
2009
Springer
15 years 8 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...