6598 search results - page 1036 / 1320 » Graph Theory with Applications |
223
click to vote
WIDM
2004
ACM
16 years 4 days ago
2004
ACM
A Focused crawler must use information gleaned from previously crawled page sequences to estimate the relevance of a newly seen URL. Therefore, good performance depends on powerfu...
160
click to vote
APPROX
2004
Springer
16 years 3 days ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
166
click to vote
DEXA
2004
Springer
16 years 3 days ago
2004
Springer
Much work has been done on characterizing the workload of a database system. Previous studies focused on providing different types of statistical summaries, and modeling the run-ti...
177
click to vote
FPL
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. Function evaluation is at the core of many compute-intensive applications which perform well on reconfigurable platforms. Yet, in order to implement function evaluation ...
145
click to vote
ICCS
2004
Springer
16 years 2 days ago
2004
Springer
Communication latencies have been identified as one of the performance limiting factors of message passing applications in clusters of workstations/multiprocessors. On the receiver...