Sciweavers

2880 search results - page 252 / 576
» Approximate Range Searching
Sort
View
139
Voted
JORS
2011
67views more  JORS 2011»
14 years 10 months ago
Robust parameter design optimization of simulation experiments using stochastic perturbation methods
Stochastic perturbation methods can be applied to problems for which either the objective function is represented analytically, or the objective function is the result of a simula...
A. K. Miranda, E. Del Castillo
108
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Target localization with NLOS circularly reflected AOAS
Bearings-only localization with light-of-sight (LOS) propagation is well understood. This paper concentrates on bearing-only localization with non-line-of-sight (NLOS) measurement...
Xiufeng Song, Peter Willett, Shengli Zhou
ICCV
2011
IEEE
14 years 3 months ago
HEAT: Iterative Relevance Feedback with One Million Images
It has been shown repeatedly that iterative relevance feedback is a very efficient solution for content-based image retrieval. However, no existing system scales gracefully to hu...
Nicolae Suditu, Francois Fleuret
111
Voted
STOC
2009
ACM
102views Algorithms» more  STOC 2009»
16 years 4 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
WWW
2008
ACM
16 years 4 months ago
Web graph similarity for anomaly detection (poster)
Web graphs are approximate snapshots of the web, created by search engines. Their creation is an error-prone procedure that relies on the availability of Internet nodes and the fa...
Panagiotis Papadimitriou 0002, Ali Dasdan, Hector ...