5889 search results - page 1078 / 1178 » Graph Layout Problems |
AIIA
2001
Springer
15 years 2 months ago
2001
Springer
The exponential growth of documents available in the World Wide Web makes it increasingly difficult to discover relevant information on a specific topic. In this context, growing ...
COCOON
2001
Springer
15 years 2 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...
ESA
2001
Springer
15 years 2 months ago
2001
Springer
Suppose that a program makes a sequence of m accesses (references) to data blocks, the cache can hold k < m blocks, an access to a block in the cache incurs one time unit, and ...
SAS
2001
Springer
15 years 2 months ago
2001
Springer
Programs often have a lot of duplicated code, which makes both understanding and maintenance more difficult. This problem can be alleviated by detecting duplicated code, extracting...
VLDB
2001
ACM
15 years 2 months ago
2001
ACM
In this paper we focus on the following problem in information management: given a large collection of recorded information and some knowledge of the process that is generating th...