2503 search results - page 226 / 501 » A study of 3-arc graphs |
160
click to vote
AMW
2010
15 years 8 months ago
2010
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination in RDF in the presence of rules (in the form of Datalog rules) a...
185
click to vote
ECIR
2008
Springer
15 years 8 months ago
2008
Springer
It is important to integrate contextual information in order to improve the inaccurate results of current approaches for automatic image annotation. Graph based representations all...
173
click to vote
CPC
2007
15 years 6 months ago
2007
We study a point process describing the asymptotic behavior of sizes of the largest components of the random graph G(n, p) in the critical window, that is, for p = n−1 + λn−4/...
163
click to vote
JPDC
2006
15 years 6 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
164
click to vote
JUCS
2007
15 years 6 months ago
2007
: In this paper, we study spectral versions of the densest subgraph problem and the largest independence subset problem. In the first part, we give an algorithm for identifying sm...