Sciweavers

1059 search results - page 135 / 212
» Improved Algorithms via Approximations of Probability Distri...
Sort
View
ICDE
2008
IEEE
146views Database» more  ICDE 2008»
14 years 10 months ago
Handling Uncertain Data in Array Database Systems
Scientific and intelligence applications have special data handling needs. In these settings, data does not fit the standard model of short coded records that had dominated the dat...
Tingjian Ge, Stanley B. Zdonik
CDC
2010
IEEE
13 years 4 months ago
Preference elicitation in Fully Probabilistic Design of decision strategies
Any systematic decision-making design selects a decision strategy that makes the resulting closed-loop behaviour close to the desired one. Fully Probabilistic Design (FPD) describe...
Miroslav Kárný, Tatiana V. Guy
IJCAI
2003
13 years 10 months ago
Covariant Policy Search
We investigate the problem of non-covariant behavior of policy gradient reinforcement learning algorithms. The policy gradient approach is amenable to analysis by information geom...
J. Andrew Bagnell, Jeff G. Schneider
CIVR
2007
Springer
160views Image Analysis» more  CIVR 2007»
14 years 3 months ago
Automatic image annotation by an iterative approach: incorporating keyword correlations and region matching
Automatic image annotation automatically labels image content with semantic keywords. For instance, the Relevance Model estimates the joint probability of the keyword and the imag...
Xiangdong Zhou, Mei Wang, Qi Zhang, Junqi Zhang, B...
EUROCRYPT
1999
Springer
14 years 1 months ago
An Analysis of Exponentiation Based on Formal Languages
A recoding rule for exponentiation is a method for reducing the cost of the exponentiation ae by reducing the number of required multiplications. If w(e) is the (hamming) weight of...
Luke O'Connor