1380 search results - page 110 / 276 » A General Polynomial Sieve |
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
ECCC
2006
13 years 10 months ago
2006
Abstract. Circuits composed of threshold gates (McCulloch-Pitts neurons, or perceptrons) are simplified models of neural circuits with the advantage that they are theoretically mor...
SODA
2010
ACM
13 years 8 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
HYBRID
2009
Springer
14 years 4 months ago
2009
Springer
We show that regarding finite automata (FA) as discrete, time-invariant linear systems over semimodules, allows to: (1) express FA minimization and FA determinization as particula...
ICDE
2008
IEEE
14 years 4 months ago
2008
IEEE
We formulate three intuitive semantic properties for topk queries in probabilistic databases, and propose GlobalTopk query semantics which satisfies all of them. We provide a dyn...