900 search results - page 63 / 180 » On Polynomial Time Computation over Unordered Structures |
BMCBI
2004
13 years 8 months ago
2004
Background: The general problem of RNA secondary structure prediction under the widely used thermodynamic model is known to be NP-complete when the structures considered include a...
STOC
2010
ACM
14 years 1 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
P2P
2005
IEEE
14 years 2 months ago
2005
IEEE
We address the problem of highly transient populations in unstructured and loosely-structured peerto-peer systems. We propose a number of illustrative query-related strategies and...
STOC
2007
ACM
14 years 9 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
ICDE
2009
IEEE
14 years 10 months ago
2009
IEEE
In many applications, we need to analyze a large number of time series. Segments of time series demonstrating dominating advantages over others are often of particular interest. In...