10051 search results - page 159 / 2011 » A Dynamic Separator Algorithm |
113
click to vote
COCOON
2001
Springer
15 years 5 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...
131
click to vote
COMGEO
1999
ACM
15 years 17 days ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
131
click to vote
CRYPTO
2011
Springer
14 years 21 days ago
2011
Springer
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
121
click to vote
IJCV
2002
15 years 18 days ago
2002
In this paper, a new hierarchical stereo algorithm is presented. The algorithm matches individual pixels in corresponding scanlines by minimizing a cost function. Several cost fun...
102
click to vote
CLIMA
2004
15 years 2 months ago
2004
Though multiagent systems (MASs) are being increasingly used, few methods exist to ensure survivability of MASs. All existing methods suffer from two flaws. First, a centralized su...