217 search results - page 41 / 44 » Backdoors To Typical Case Complexity |
171
click to vote
RECOMB
2006
Springer
16 years 5 months ago
2006
Springer
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
127
click to vote
CPAIOR
2009
Springer
15 years 11 months ago
2009
Springer
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
140
click to vote
SSD
2009
Springer
15 years 11 months ago
2009
Springer
A key issue in clustering data, regardless the algorithm used, is the definition of a distance function. In the case of trajectory data, different distance functions have been pro...
159
click to vote
ATAL
2007
Springer
15 years 11 months ago
2007
Springer
Activity recognition is a key component for creating intelligent, multi-agent systems. Intrinsically, activity recognition is a temporal classification problem. In this paper, we...
151
click to vote
ATVA
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...