Sciweavers

7015 search results - page 1153 / 1403
» Approximation algorithms for co-clustering
Sort
View
CIKM
2007
Springer
15 years 10 months ago
Hybrid results merging
The problem of results merging in distributed information retrieval environments has been approached by two different directions in research. Estimation approaches attempt to cal...
Georgios Paltoglou, Michail Salampasis, Maria Satr...
IWMM
2007
Springer
110views Hardware» more  IWMM 2007»
15 years 10 months ago
Path: page access tracking to improve memory management
Traditionally, operating systems use a coarse approximation of memory accesses to implement memory management algorithms by monitoring page faults or scanning page table entries. ...
Reza Azimi, Livio Soares, Michael Stumm, Thomas Wa...
INFOCOM
2005
IEEE
15 years 9 months ago
Credit based fair scheduling for packet switched networks
With the rapid development of Internet multimedia applications, the next generation of networks is required to schedule not only the best effort traffic but also the traffic wit...
Deng Pan, Yuanyuan Yang
ATAL
2005
Springer
15 years 9 months ago
Exploiting belief bounds: practical POMDPs for personal assistant agents
Agents or agent teams deployed to assist humans often face the challenges of monitoring the state of key processes in their environment (including the state of their human users t...
Pradeep Varakantham, Rajiv T. Maheswaran, Milind T...
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
15 years 9 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
« Prev « First page 1153 / 1403 Last » Next »