Sciweavers

1983 search results - page 154 / 397
» Competitive graph searches
Sort
View
SIGMOD
2009
ACM
111views Database» more  SIGMOD 2009»
14 years 8 months ago
Language-model-based ranking in entity-relation graphs
We propose a language-model-based ranking approach for SPARQLlike queries on entity-relationship graphs. Our ranking model supports exact matching, approximate structure matching,...
Shady Elbassuoni, Maya Ramanath, Gerhard Weikum
ICCS
2000
Springer
13 years 11 months ago
A Conceptual Graph Model for W3C Resource Description Framework
With the aim of building a "Semantic Web", the content of the documents must be explicitly represented through metadata in order to enable contents-guided search. Our app...
Olivier Corby, Rose Dieng, Cédric Hé...
4OR
2004
84views more  4OR 2004»
13 years 8 months ago
Non-classical preference models in combinatorial problems: Models and algorithms for graphs
This is a summary of the most important results presented in the author's PhD thesis (Spanjaard, 2003). This thesis, written in French, was defended on 16 December 2003 and su...
Olivier Spanjaard
ALGORITHMICA
2002
71views more  ALGORITHMICA 2002»
13 years 8 months ago
Routing Flow Through a Strongly Connected Graph
It is shown that, for every strongly connected network in which every edge has capacity at least , linear time suffices to send flow from source vertices, each with a given supply,...
Thomas Erlebach, Torben Hagerup
WAIM
2010
Springer
13 years 5 months ago
Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs
SimRank has been considered as one of the promising link-based ranking algorithms to evaluate similarities of web documents in many modern search engines. In this paper, we investi...
Weiren Yu, Xuemin Lin, Jiajin Le