Sciweavers

545 search results - page 55 / 109
» Estimating the Probability of Approximate Matches
Sort
View
93
Voted
ICML
2003
IEEE
16 years 1 months ago
Action Elimination and Stopping Conditions for Reinforcement Learning
We consider incorporating action elimination procedures in reinforcement learning algorithms. We suggest a framework that is based on learning an upper and a lower estimates of th...
Eyal Even-Dar, Shie Mannor, Yishay Mansour
95
Voted
ESANN
2004
15 years 2 months ago
Convergence properties of a fuzzy ARTMAP network
FAMR (Fuzzy ARTMAP with Relevance factor) is a FAM (Fuzzy ARTMAP) neural network used for classification, probability estimation [3], [2], and function approximation [4]. FAMR uses...
Razvan Andonie, Lucian Sasu
TIT
2002
62views more  TIT 2002»
15 years 11 days ago
Maximum-likelihood binary shift-register synthesis from noisy observations
We consider the problem of estimating the feedback coefficients of a linear feedback shift register (LFSR) based on noisy observations. In the current approach, the coefficients a...
Todd K. Moon
96
Voted
ICASSP
2011
IEEE
14 years 4 months ago
CLT for eigen-inference methods in cognitive radios
This article provides a central limit theorem for a consistent estimator of the population eigenvalues of a class of sample covariance matrices. An exact expression as well as an ...
Jianfeng Yao, Romain Couillet, Jamal Najim, Eric M...
103
Voted
COMPGEOM
2006
ACM
15 years 6 months ago
Lower bounds on locality sensitive hashing
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
Rajeev Motwani, Assaf Naor, Rina Panigrahy