4860 search results - page 360 / 972 » SNPs Problems, Complexity, and Algorithms |
115
Voted
ICLP
1997
Springer
15 years 7 months ago
1997
Springer
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the prog...
114
Voted
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
Generalizing the concept of a Reeb graph, the Reeb space of a multivariate continuous mapping identifies points of the domain that belong to a common component of the preimage of ...
146
Voted
ISAAC
2010
Springer
15 years 1 months ago
2010
Springer
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
131
Voted
ICFCA
2010
Springer
15 years 10 months ago
2010
Springer
We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents det...
144
Voted
PDP
2003
IEEE
15 years 8 months ago
2003
IEEE
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...