Sciweavers

8746 search results - page 571 / 1750
» Diversifying search results
Sort
View
ICASSP
2010
IEEE
15 years 7 months ago
Approximate nearest neighbors using sparse representations
A new method is introduced that makes use of sparse image representations to search for approximate nearest neighbors (ANN) under the normalized inner-product distance. The approa...
Joaquin Zepeda, Ewa Kijak, Christine Guillemot
ENTCS
2008
120views more  ENTCS 2008»
15 years 7 months ago
Complementarity of Error Detection Techniques
We study explicit techniques for detection of safety errors, e.g., depth-first search, directed search, random walk, and bitstate hashing. We argue that it is not important to fin...
Radek Pelánek, Václav Rosecký...
203
Voted
EOR
2008
107views more  EOR 2008»
15 years 7 months ago
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
Alysson M. Costa, Jean-François Cordeau, Gi...
216
Voted
CORR
2006
Springer
126views Education» more  CORR 2006»
15 years 7 months ago
Evaluating the Robustness of Learning from Implicit Feedback
This paper evaluates the robustness of learning from implicit feedback in web search. In particular, we create a model of user behavior by drawing upon user studies in laboratory ...
Filip Radlinski, Thorsten Joachims
CSDA
2006
71views more  CSDA 2006»
15 years 7 months ago
Computation of Huber's M-estimates for a block-angular regression problem
Huber's M-estimation technique is applied to a block-angular regression problem, which may arise from some applications. A recursive, modified Newton approach to computing th...
Xiao-Wen Chang