Sciweavers

206 search results - page 33 / 42
» Efficient adaptive collect using randomization
Sort
View
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
15 years 10 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
SIGIR
2009
ACM
15 years 4 months ago
On social networks and collaborative recommendation
Social network systems, like last.fm, play a significant role in Web 2.0, containing large amounts of multimedia-enriched data that are enhanced both by explicit user-provided an...
Ioannis Konstas, Vassilios Stathopoulos, Joemon M....
81
Voted
TREC
2003
14 years 11 months ago
Fondazione Ugo Bordoni at TREC 2003: Robust and Web Track
Our participation in TREC 2003 aims to adapt the use of the DFR (Divergence From Randomness) models with Query Expansion (QE) to the robust track and the topic distillation task o...
Giambattista Amati, Claudio Carpineto, Giovanni Ro...
87
Voted
CVPR
2008
IEEE
16 years 5 days ago
A joint appearance-spatial distance for kernel-based image categorization
The goal of image categorization is to classify a collection of unlabeled images into a set of predefined classes to support semantic-level image retrieval. The distance measures ...
Guo-Jun Qi, Xian-Sheng Hua, Yong Rui, Jinhui Tang,...
ICCCN
2007
IEEE
15 years 4 months ago
Fates: A Granular Approach to Real-Time Anomaly Detection
— Anomaly-based intrusion detection systems have the ability of detecting novel attacks, but in real-time detection, they face the challenges of producing many false alarms and f...
Jeff Janies, Chin-Tser Huang