5785 search results - page 740 / 1157 » Approximability of Probability Distributions |
221
click to vote
KDD
2004
ACM
16 years 4 days ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
181
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— Q-learning is a technique used to compute an optimal policy for a controlled Markov chain based on observations of the system controlled using a non-optimal policy. It ...
177
click to vote
EUROCRYPT
1999
Springer
15 years 11 months ago
1999
Springer
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...
186
click to vote
VISUALIZATION
1997
IEEE
15 years 11 months ago
1997
IEEE
We present a multiresolution framework, called Multi-Tetra framework, that approximates volume data with different levelsof-detail tetrahedra. The framework is generated through a...
181
click to vote
NN
1997
Springer
15 years 11 months ago
1997
Springer
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...