Sciweavers

16504 search results - page 189 / 3301
» New Problems, New Solutions
Sort
View
SIGSOFT
2006
ACM
16 years 7 months ago
SYNERGY: a new algorithm for property checking
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...
Bhargav S. Gulavani, Thomas A. Henzinger, Yamini K...
STACS
2007
Springer
16 years 18 days ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
BMCBI
2005
114views more  BMCBI 2005»
15 years 6 months ago
A new decoding algorithm for hidden Markov models improves the prediction of the topology of all-beta membrane proteins
Background: Structure prediction of membrane proteins is still a challenging computational problem. Hidden Markov models (HMM) have been successfully applied to the problem of pre...
Piero Fariselli, Pier Luigi Martelli, Rita Casadio
ATAL
2009
Springer
16 years 1 months ago
Generalizing DPOP: Action-GDL, a new complete algorithm for DCOPs
In this paper we propose a novel message-passing algorithm, the so-called Action-GDL, as an extension to the Generalized Distributive Law algorithm (GDL) [1] to efficiently solve...
Meritxell Vinyals, Juan A. Rodríguez-Aguila...
CSR
2009
Springer
16 years 1 months ago
New Plain-Exponential Time Classes for Graph Homomorphism
A homomorphism from a graph G to a graph H (in this paper, both simple, undirected graphs) is a mapping f : V (G) → V (H) such that if uv ∈ E(G) then f(u)f(v) ∈ E(H). The pro...
Magnus Wahlström