2252 search results - page 2 / 451 » Lower Bounds for Dynamic Algorithms |
DAGSTUHL
2006
13 years 9 months ago
2006
In this paper we study a class of dynamical systems defined by Pfaffian maps. It is a sub-class of o-minimal dynamical systems which capture rich continuous dynamics and yet can be...
ICCAD
2006
IEEE
14 years 4 months ago
2006
IEEE
We present a dynamic voltage scaling (DVS) technique that minimizes system-wide energy consumption for both periodic and sporadic tasks. It is known that a system consists of proc...
COCO
2011
Springer
12 years 7 months ago
2011
Springer
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MODm gates, where m > 1 is an arbitrary constant. We prove: • NTIME[2n ...
RECOMB
2005
Springer
14 years 7 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
PAKDD
2009
ACM
14 years 1 days ago
2009
ACM
We propose a new method, called SimClus, for clustering with lower bound on similarity. Instead of accepting k the number of clusters to find, the alternative similarity-based app...