Sciweavers

580 search results - page 43 / 116
» Approximation Algorithms for Temporal Reasoning
Sort
View
IJCAI
2007
15 years 3 months ago
Scalable Diagnosability Checking of Event-Driven Systems
Diagnosability of systems is an essential property that determines how accurate any diagnostic reasoning can be on a system given any sequence of observations. Generally, in the l...
Anika Schumann, Yannick Pencolé
SWAT
2010
Springer
204views Algorithms» more  SWAT 2010»
15 years 9 days ago
Feasible and Accurate Algorithms for Covering Semidefinite Programs
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
Garud Iyengar, David J. Phillips, Clifford Stein
IJON
2008
114views more  IJON 2008»
15 years 2 months ago
A robust model for spatiotemporal dependencies
Real-world data sets such as recordings from functional magnetic resonance imaging often possess both spatial and temporal structure. Here, we propose an algorithm including such ...
Fabian J. Theis, Peter Gruber, Ingo R. Keck, Elmar...
ICALP
2004
Springer
15 years 7 months ago
A Faster Algorithm for Minimum Cycle Basis of Graphs
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
CIS
2004
Springer
15 years 7 months ago
Algorithms for Loosely Constrained Multiple Sequence Alignment
For finding accurate and biologically meaningful multiple sequence alignment, it is required to consider a loosely constrained version of multiple sequence alignment. This paper is...
Bin Song, Fengfeng Zhou, Guoliang Chen