18306 search results - page 370 / 3662 » Algorithmics in Exponential Time |
170
click to vote
COCOON
2001
Springer
15 years 11 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
178
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Standard detection algorithms for nonlinearity linkage fail when applied to typical problems in the analysis of financial time-series data. We explain how this failure arises whe...
252
click to vote
OPODIS
2010
15 years 4 months ago
2010
We consider the problem of scheduling dependent real-time tasks for overloads on a multiprocessor system, yielding best-effort timing assurance. The application/scheduling model in...
179
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
201
click to vote
ISCAS
2006
IEEE
16 years 27 days ago
2006
IEEE
— This paper presents some circuitry for use within a visual-processing depth-recovery algorithm based upon spike timing. The accuracy of the depth calculation relies on a predic...