451 search results - page 13 / 91 » On Parameterized Exponential Time Complexity |
CHARME
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. We propose new, tractably (in some cases provably) efficient algorithmic methods for exact (sound and complete) parameterized reasoning about cache coherence protocols. F...
IWOCA
2010
Springer
13 years 4 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
ISPDC
2010
IEEE
13 years 8 months ago
2010
IEEE
—In this paper, we propose SKAIT, a parameterized symmetric key pre-distribution scheme that guarantees a secure and confidential channel between every pair of nodes in a wirele...
CVPR
1999
IEEE
14 years 12 months ago
1999
IEEE
A spatio-temporal representation for complex optical flow events is developed that generalizes traditional parameterized motion models (e.g. affine). These generative spatio-tempo...
ICALP
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...