Sciweavers

3475 search results - page 162 / 695
» Backbones in Optimization and Approximation
Sort
View
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 7 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
ICML
2010
IEEE
15 years 7 months ago
Nonparametric Return Distribution Approximation for Reinforcement Learning
Standard Reinforcement Learning (RL) aims to optimize decision-making rules in terms of the expected return. However, especially for risk-management purposes, other criteria such ...
Tetsuro Morimura, Masashi Sugiyama, Hisashi Kashim...
IPL
2006
115views more  IPL 2006»
15 years 6 months ago
Approximate maximum weight branchings
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...
Amitabha Bagchi, Ankur Bhargava, Torsten Suel
TIP
2008
113views more  TIP 2008»
15 years 6 months ago
Phase Local Approximation (PhaseLa) Technique for Phase Unwrap From Noisy Data
The local polynomial approximation (LPA) is a nonparametric regression technique with pointwise estimation in a sliding window. We apply the LPA of the argument of cos and sin in o...
Vladimir Katkovnik, Jaakko Astola, Karen O. Egiaza...
CVPR
2010
IEEE
15 years 5 months ago
Transform Coding for Fast Approximate Nearest Neighbor Search in High Dimensions
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
Jonathan Brandt