Sciweavers

58 search results - page 6 / 12
» Fast Collect in the absence of contention
Sort
View
CVPR
2008
IEEE
14 years 9 months ago
Selective hidden random fields: Exploiting domain-specific saliency for event classification
Classifying an event captured in an image is useful for understanding the contents of the image. The captured event provides context to refine models for the presence and appearan...
Vidit Jain, Amit Singhal, Jiebo Luo
WWW
2011
ACM
13 years 2 months ago
Prophiler: a fast filter for the large-scale detection of malicious web pages
Malicious web pages that host drive-by-download exploits have become a popular means for compromising hosts on the Internet and, subsequently, for creating large-scale botnets. In...
Davide Canali, Marco Cova, Giovanni Vigna, Christo...
SIGIR
2006
ACM
14 years 1 months ago
Type less, find more: fast autocompletion search with a succinct index
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
Holger Bast, Ingmar Weber
AMM
2011
118views more  AMM 2011»
13 years 2 months ago
From Community Detection to Mentor Selection in Rating-Free Collaborative Filtering
—The number of resources or items that users can now access when navigating on the Web or using e-services, is so huge that these might feel lost due to the presence of too much ...
Armelle Brun, Sylvain Castagnos, Anne Boyer
TSP
2010
13 years 2 months ago
Decentralized sparse signal recovery for compressive sleeping wireless sensor networks
Abstract--This paper develops an optimal decentralized algorithm for sparse signal recovery and demonstrates its application in monitoring localized phenomena using energy-constrai...
Qing Ling, Zhi Tian