553 search results - page 58 / 111 » Cover Contact Graphs |
80
Voted
JUCS
2006
15 years 14 days ago
2006
: This paper surveys some of the work that was inspired by Wagner's general technique to prove completeness in the levels of the boolean hierarchy over NP and some related res...
109
click to vote
RR
2010
Springer
14 years 11 months ago
2010
Springer
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination on RDF graphs in the presence of rules (in the form of Datalog r...
117
Voted
APVIS
2011
14 years 15 days ago
2011
We present the results of a study comparing five directed-edge representations for use in 2D, screen-based node-link diagrams. The goal of this work is to extend the understandin...
135
click to vote
MSWIM
2006
ACM
15 years 6 months ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
80
Voted
SPAA
1990
ACM
15 years 4 months ago
1990
ACM
d Abstract) Richard J. Anderson Paul Beame Walter L. Ruzzo Department of Computer Science and Engineering University of Washingtoni We introduce a task scheduling model which is u...