147 search results - page 5 / 30 » Parallel Query Processing and Edge Ranking of Graphs |
ICPADS
2005
IEEE
15 years 3 months ago
2005
IEEE
PageRank becomes the most well-known re-ranking technique of the search results. By its iterative computational nature, the computation takes much computing time and resource. Res...
215
click to vote
ICDE
2008
IEEE
16 years 9 months ago
2008
IEEE
The Web has the potential to become the world’s
largest knowledge base. In order to unleash this potential,
the wealth of information available on the Web needs to be
extracte...
WWW
2007
ACM
15 years 10 months ago
2007
ACM
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
87
Voted
PDPTA
1996
14 years 10 months ago
1996
The problem of eciently retrieving and ranking documents from a huge collection according to their relevance to a research topic is addressed. A broad class of queries is de ned a...
COLING
2008
14 years 11 months ago
2008
Query-oriented update summarization is an emerging summarization task very recently. It brings new challenges to the sentence ranking algorithms that require not only to locate th...