Sciweavers

1983 search results - page 107 / 397
» Competitive graph searches
Sort
View
SEMWEB
2007
Springer
14 years 2 months ago
YARS2: A Federated Repository for Querying Graph Structured Data from the Web
We present the architecture of an end-to-end semantic search engine that uses a graph data model to enable interactive query answering over structured and interlinked data collecte...
Andreas Harth, Jürgen Umbrich, Aidan Hogan, S...
ICIW
2009
IEEE
13 years 5 months ago
Using Propagation of Distrust to Find Untrustworthy Web Neighborhoods
Web spamming, the practice of introducing artificial text and links into web pages to affect the results of searches, has been recognized as a major problem for search engines. Bu...
Panagiotis Takis Metaxas
ICALP
2011
Springer
12 years 11 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
APWEB
2008
Springer
13 years 10 months ago
The Layered World of Scientific Conferences
Recent models have introduced the notion of dimensions and hierarchies in social networks. These models motivate the mining of small world graphs under a new perspective. We exempl...
Michael Kuhn 0002, Roger Wattenhofer
JCP
2008
171views more  JCP 2008»
13 years 7 months ago
Mining Frequent Subgraph by Incidence Matrix Normalization
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
Jia Wu, Ling Chen