395 search results - page 31 / 79 » Degrees of Weakly Computable Reals |
TCS
2008
13 years 8 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
ICCV
2009
IEEE
13 years 6 months ago
2009
IEEE
Within the field of action recognition, features and descriptors are often engineered to be sparse and invariant to transformation. While sparsity makes the problem tractable, it ...
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...
POPL
2009
ACM
14 years 3 months ago
2009
ACM
With the emergence of commodity multicore architectures, exploiting tightly-coupled parallelism has become increasingly important. Functional programming languages, such as Haskel...
WEA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...