1538 search results - page 142 / 308 » Spectral Techniques in Graph Algorithms |
113
click to vote
SAC
2008
ACM
15 years 3 months ago
2008
ACM
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...
136
Voted
IADIS
2004
15 years 5 months ago
2004
Since XML becomes a crucial format for representing information, it is necessary to establish techniques for managing XML documents. A possible solution can be found in storing XM...
134
Voted
COCOON
2001
Springer
15 years 8 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...
151
click to vote
FTTCS
2006
15 years 3 months ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
121
Voted
IJCV
2006
15 years 3 months ago
2006
This paper explores various aspects of the image decomposition problem using modern variational techniques. We aim at splitting an original image f into two components u and v, whe...