3663 search results - page 236 / 733 » Problems in the ontology of computer programs |
222
click to vote
LOGCOM
2010
15 years 1 months ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
174
click to vote
RECOMB
2003
Springer
16 years 7 months ago
2003
Springer
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
164
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensor...
177
click to vote
ICLP
2004
Springer
16 years 3 hour ago
2004
Springer
Arc-Consistency (AC) techniques have been used extensively in the study of Constraint Satisfaction Problems (CSP). These techniques are used to simplify the CSP before or during th...
142
click to vote
SP
2008
IEEE
16 years 1 months ago
2008
IEEE
Many basic tasks in computational biology involve operations on individual DNA and protein sequences. These sequences, even when anonymized, are vulnerable to re-identification a...