✦ LIBER ✦

s-HITSc: an improved model and algorithm for topic distillation on the Web

✍ Scribed by Zhuoming XU; Xiao CAO; Yisheng DONG; Yahong HAN

Book ID: 106168958
Publisher: Springer
Year: 2005
Tongue: English
Weight: 307 KB
Volume: 10
Category: Article
ISSN: 1432-7643
DOI: 10.1007/s00500-005-0529-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

s-HITSc: an improved model and algorithm

s-HITSc: an improved model and algorithm for topic distillation on the Web

✍ Zhuoming XU; Xiao CAO; Yisheng DONG; Yahong HAN 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 421 KB

WAM: an improved algorithm for modelling

WAM: an improved algorithm for modelling antibodies on the WEB

✍ Whitelegg, N. R.J.; Rees, A. R. 📂 Article 📅 2000 🏛 Oxford University Press 🌐 English ⚖ 88 KB

On “an improved algorithm for finding th

On “an improved algorithm for finding the median distributively” [1]

✍ S. L. Mantzaris 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 172 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Models for the Web-Graph Volume 6516 || Modeling Traffic on the Web Graph

✍ Kumar, Ravi; Sivakumar, Dandapani 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg ⚖ 463 KB

An Improved Fast Multipole Algorithm for

An Improved Fast Multipole Algorithm for Potential Fields on the Line

✍ Yarvin, Norman; Rokhlin, Vladimir 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 618 KB

An improved algorithm for the minmax reg

An improved algorithm for the minmax regret median problem on a tree

✍ Igor Averbakh; Oded Berman 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB 👁 1 views

## Abstract We consider the 1‐median problem with uncertain weights for nodes. Specifically, for each node, only an interval estimate of its weight is known. It is required to find a “minmax regret” location, that is, to minimize the worst‐case loss in the objective function that may occur because