Sciweavers

7150 search results - page 11 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
15 years 7 months ago
ApproxRank: Estimating Rank for a Subgraph
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...
Yao Wu, Louiqa Raschid
108
Voted
COMPUTING
2006
112views more  COMPUTING 2006»
15 years 12 days ago
Fast Summation of Radial Functions on the Sphere
Radial functions are a powerful tool in many areas of multidimensional approximation, especially when dealing with scattered data. We present a fast approximate algorithm for the ...
Jens Keiner, Stefan Kunis, Daniel Potts
ENTCS
2008
116views more  ENTCS 2008»
15 years 13 days ago
Phil: A Lazy Implementation of a Language for Approximate Filtering of XML Documents
In this paper, we introduce a system, written in Haskell, for filtering information from XML data. Essentially, the system implements a simple declarative language which allows on...
Michele Baggi, Demis Ballis
100
Voted
IM
2007
15 years 8 days ago
Ranking Websites: A Probabilistic View
In this paper we suggest evaluating the importance of a website with the mean frequency of visiting the website for the Markov chain on the Internet Graph describing random surfi...
Ying Bao, Guang Feng, Tie-Yan Liu, Zhiming Ma, Yin...
112
Voted
ALT
2008
Springer
15 years 9 months ago
Smooth Boosting for Margin-Based Ranking
We propose a new boosting algorithm for bipartite ranking problems. Our boosting algorithm, called SoftRankBoost, is a modification of RankBoost which maintains only smooth distri...
Jun-ichi Moribe, Kohei Hatano, Eiji Takimoto, Masa...