Sciweavers

4894 search results - page 719 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
ICASSP
2011
IEEE
13 years 14 hour ago
Distributed linear discriminant analysis
Linear discriminant analysis (LDA) is a widely used feature extraction method for classification. We introduce distributed implementations of different versions of LDA, suitable ...
Sergio Valcarcel Macua, Pavle Belanovic, Santiago ...
ECIR
2011
Springer
12 years 11 months ago
Enhancing Deniability against Query-Logs
We propose a method for search privacy on the Internet, focusing on enhancing plausible deniability against search engine query-logs. The method approximates the target search resu...
Avi Arampatzis, Pavlos Efraimidis, George Drosatos
IACR
2011
206views more  IACR 2011»
12 years 8 months ago
Shortest Lattice Vectors in the Presence of Gaps
Given a lattice L with the i-th successive minimum λi, its i-th gap λi λ1 often provides useful information for analyzing the security of cryptographic schemes related to L. The...
Mingjie Liu, Xiaoyun Wang, Guangwu Xu, Xuexin Zhen...
CVPR
2012
IEEE
11 years 10 months ago
Image denoising: Can plain neural networks compete with BM3D?
Image denoising can be described as the problem of mapping from a noisy image to a noise-free image. The best currently available denoising methods approximate this mapping with c...
Harold Christopher Burger, Christian J. Schuler, S...
STOC
2009
ACM
102views Algorithms» more  STOC 2009»
14 years 9 months ago
Multiple intents re-ranking
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...
Yossi Azar, Iftah Gamzu, Xiaoxin Yin