Sciweavers

5580 search results - page 903 / 1116
» Randomized priority algorithms
Sort
View
CIKM
2009
Springer
15 years 8 months ago
Feature selection for ranking using boosted trees
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
Feng Pan, Tim Converse, David Ahn, Franco Salvetti...
SIGMETRICS
2009
ACM
182views Hardware» more  SIGMETRICS 2009»
15 years 8 months ago
The age of gossip: spatial mean field regime
Disseminating a piece of information, or updates for a piece of information, has been shown to benefit greatly from simple randomized procedures, sometimes referred to as gossipi...
Augustin Chaintreau, Jean-Yves Le Boudec, Nikodin ...
ICDCS
2008
IEEE
15 years 8 months ago
Correlation-Aware Object Placement for Multi-Object Operations
A multi-object operation incurs communication or synchronization overhead when the requested objects are distributed over different nodes. The object pair correlations (the probab...
Ming Zhong, Kai Shen, Joel I. Seiferas
ICIP
2008
IEEE
15 years 8 months ago
Generalized ELL for detecting and tracking through illumination model changes
In previous work, we developed the Illum-PF-MT, which is the PFMT idea applied to the problem of tracking temporally and spatially varying illumination change. In many practical p...
Amit Kale, Namrata Vaswani
GLOBECOM
2007
IEEE
15 years 8 months ago
Beamforming with Limited Feedback in Amplify-and-Forward Cooperative Networks
— A relay selection approach has previously been shown to outperform repetition-based scheduling for both amplify-and-forward (AF) and decode-and-forward (DF) cooperative network...
Yi Zhao, Raviraj Adve, Teng Joon Lim