1092 search results - page 85 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
122
click to vote
IJON
2002
15 years 5 months ago
2002
: Results of spike sorting algorithms are usually compared against recorded signals which themselves underly interpretations, distortions and errors. Our approach is to provide and...
208
click to vote
TCS
2011
15 years 28 days ago
2011
Models of biological systems and phenomena are of high scientific interest and practical relevance, but not always easy to obtain due to their inherent complexity. To gain the re...
179
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
141
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilisti...
152
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...