1477 search results - page 90 / 296 » On Graph Problems in a Semi-streaming Model |
111
click to vote
ENC
2004
IEEE
15 years 5 months ago
2004
IEEE
This article deals with the problem of data cache for dynamic web servers. A set of requests (which number could be large) is submitted to a server for computing. Every request is...
99
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
115
click to vote
STACS
1994
Springer
15 years 5 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
105
click to vote
ICIAP
1999
ACM
15 years 5 months ago
1999
ACM
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matchi...
208
click to vote
ICDE
2001
IEEE
16 years 2 months ago
2001
IEEE
Current workflow management technology does not provide adequate means for inter-workflow coordination as concurrently executing workflows are considered completely independent. W...