Results 261 to 270 of about 2,913,313 (303)

Accelerated inference for stochastic compartmental models with over-dispersed partial observations. [PDF]

Stat Comput
Whitehouse M.
europepmc   +1 more source

Dictionary Learning Methods for Brain Activity Mapping with MEG Data. [PDF]

Brain Topogr
Calvetti D, Somersalo E.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

An approximation algorithm for the TSP

Information Processing Letters, 1989
For a given complete weighted graph with n nodes, the authors present a heuristic algorithm with running time \(O(n^ 4)\) for the travelling salesman problem. Experimental studies show that the method gives better results in most cases than the well-known Quick method.
Josep M. Basart, Llorenç Huguet i Rotger   +1 more
openaire   +3 more sources

Approximation Algorithms for Treewidth

Algorithmica, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

On Approximation Algorithms for # P

SIAM Journal on Computing, 1985
It is shown that any function in Valiant's class {\#}P can be approximated to within any constant factor by a function in the class \(\Delta^ P_ 3\) of the polynomial-time hierarchy. A model of random sampling is introduced and discussed in detail. The paper is of interest to specialists in the theory of algorithmic complexity.
openaire   +3 more sources

The Design of Approximation Algorithms

2011
Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms to find optimal solutions.
David P. Williamson, David B. Shmoys
openaire   +2 more sources

Approximate decision algorithms for approximate congruence

Information Processing Letters, 1992
We derive a \(({1\over 2} \varepsilon_{opt}(A,B), \varepsilon_{opt}(A,B))\)-approximate algorithm for approximate congruence by translations with running time \(O(n^{2.5})\) and a \(({1\over 2},\varepsilon_{opt}(A,B) \varepsilon_{opt}(A,B))\)- approximate algorithm with running time \(O(n^ 4)\) for the general case.
openaire   +2 more sources

Algorithms for approximate FSM traversal

Proceedings of the 30th international on Design automation conference - DAC '93, 1993
In this paper we present algorithms for approximate FSM traversal based on state space decomposition. The original FSM is partitioned in sub-machines, and each of them is traversed separately; the result is an over-estimation of the set of reachable states. Several traversal strategies are discussed.
CHO H, HACHTEL G. D, MACII, Enrico, PLESSIER B, SOMENZI F.   +4 more
openaire   +2 more sources

An Algorithm for Approximate Tandem Repeats

Journal of Computational Biology, 2001
A perfect single tandem repeat is defined as a nonempty string that can be divided into two identical substrings, e.g., abcabc. An approximate single tandem repeat is one in which the substrings are similar, but not identical, e.g., abcdaacd. In this paper we consider two criterions of similarity: the Hamming distance (k mismatches) and the edit ...
Gad M. Landau, Jeanette P. Schmidt, Dina Sokol   +2 more
openaire   +3 more sources