Sciweavers

115 search results - page 6 / 23
» Rank 2 Types for Term Graph Rewriting
Sort
View
ENTCS
2007
168views more  ENTCS 2007»
15 years 2 months ago
Bytecode Rewriting in Tom
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
Emilie Balland, Pierre-Etienne Moreau, Antoine Rei...
WWW
2005
ACM
16 years 3 months ago
PageRank as a function of the damping factor
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor that spreads...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
WWW
2005
ACM
16 years 3 months ago
Object-level ranking: bringing order to Web objects
In contrast with the current Web search methods that essentially do document-level ranking and retrieval, we are exploring a new paradigm to enable Web search at the object level....
Zaiqing Nie, Yuanzhi Zhang, Ji-Rong Wen, Wei-Ying ...
ICITA
2005
IEEE
15 years 8 months ago
Partition-Based Parallel PageRank Algorithm
A re-ranking technique,called “PageRank brings a successful story behind the search engine. Many studies focus on finding an way to compute the PageRank scores of a large web gr...
Arnon Rungsawang, Bundit Manaskasemsak
AIRS
2010
Springer
15 years 14 days ago
Relevance Ranking Using Kernels
This paper is concerned with relevance ranking in search, particularly that using term dependency information. It proposes a novel and unified approach to relevance ranking using ...
Jun Xu, Hang Li, Chaoliang Zhong