18306 search results - page 475 / 3662 » Algorithmics in Exponential Time |
227
Voted
CORR
2007
Springer
15 years 7 months ago
2007
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
222
click to vote
IPM
2006
15 years 7 months ago
2006
The Pathfinder algorithm is widely used to prune social networks. The pruning maintains the geodesic distances between nodes. It has shown itself to be very useful in the analysis...
202
click to vote
ALGORITHMICA
2000
15 years 7 months ago
2000
We present an O(NV +V 3) time algorithm for enumerating all spanning trees of a directed graph. This improves the previous best known bound of O(NE + V + E) [1] when V 2 = o(N), wh...
260
click to vote
DSRT
2008
IEEE
15 years 9 months ago
2008
IEEE
In this contribution a new system for the rapid development of real-time prototypes for digital audio signal processing algorithms on Windows PCs and a Digital Signal Processor (D...
188
click to vote
DEXAW
2008
IEEE
16 years 2 months ago
2008
IEEE
This paper proposes an optimistic concurrency control (CC) algorithm, called Sequential Order with Dynamic Adjustment (SODA), that guarantees timely and correct execution of concu...