Sciweavers

147 search results - page 11 / 30
» Parallel Query Processing and Edge Ranking of Graphs
Sort
View
ISPDC
2005
IEEE
15 years 3 months ago
A Distributed Prime Sieving Algorithm based on Scheduling by Multiple Edge Reversal
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...
Gabriel Paillard, Christian Antoine Louis Lavault,...
WWW
2009
ACM
15 years 10 months ago
Unsupervised query categorization using automatically-built concept graphs
Automatic categorization of user queries is an important component of general purpose (Web) search engines, particularly for triggering rich, query-specific content and sponsored ...
Eustache Diemert, Gilles Vandelle
CIKM
2011
Springer
13 years 9 months ago
Keyword search over RDF graphs
Large knowledge bases consisting of entities and relationships between them have become vital sources of information for many applications. Most of these knowledge bases adopt the...
Shady Elbassuoni, Roi Blanco
CORR
2007
Springer
121views Education» more  CORR 2007»
14 years 9 months ago
Use of Wikipedia Categories in Entity Ranking
Wikipedia is a useful source of knowledge that has many applications in language processing and knowledge representation. The Wikipedia category graph can be compared with the clas...
James A. Thom, Jovan Pehcevski, Anne-Marie Vercous...
ICML
2008
IEEE
15 years 10 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash