Sciweavers

719 search results - page 65 / 144
» Adaptive Online Time Allocation to Search Algorithms
Sort
View
PDP
2006
IEEE
15 years 3 months ago
Parallel Adaptive Technique for Computing PageRank
Re-ranking the search results using PageRank is a well-known technique used in modern search engines. Running an iterative algorithm like PageRank on a large web graph consumes bo...
Arnon Rungsawang, Bundit Manaskasemsak
WSDM
2010
ACM
365views Data Mining» more  WSDM 2010»
15 years 7 months ago
A Novel Click Model and Its Applications to Online Advertising
Recent advances in click model have positioned it as an attractive method for representing user preferences in web search and online advertising. Yet, most of the existing works f...
Zeyuan Allen Zhu, Weizhu Chen, Tom Minka, Chenguan...
EUROSYS
2009
ACM
15 years 7 months ago
Automated control of multiple virtualized resources
: Virtualized data centers enable consolidation of multiple applications and sharing of multiple resources among these applications. However, current virtualization technologies ar...
Pradeep Padala, Kai-Yuan Hou, Kang G. Shin, Xiaoyu...
EPIA
2003
Springer
15 years 3 months ago
Adaptation to Drifting Concepts
Most of supervised learning algorithms assume the stability of the target concept over time. Nevertheless in many real-user modeling systems, where the data is collected over an ex...
Gladys Castillo, João Gama, Pedro Medas
CONCURRENCY
2008
71views more  CONCURRENCY 2008»
14 years 10 months ago
Gossip-based search selection in hybrid peer-to-peer networks
We present GAB, a search algorithm for hybrid P2P networks, that is, networks that search using both flooding and a DHT. GAB uses a gossip-style algorithm to collect global statis...
M. Zaharia, S. Keshav