5785 search results - page 948 / 1157 » Approximability of Probability Distributions |
155
click to vote
TIT
2002
15 years 4 months ago
2002
Generalization bounds depending on the margin of a classifier are a relatively recent development. They provide an explanation of the performance of state-of-the-art learning syste...
138
click to vote
TJS
2002
15 years 4 months ago
2002
: With the ever-increasing demands on server applications, reliability is of paramount importance. Often these services are implemented using a distributed server cluster architect...
150
click to vote
AROBOTS
2007
15 years 4 months ago
2007
We describe a novel method whereby a particle filter is used to create a potential field for robot control without prior clustering. We show an application of this technique to ...
147
click to vote
IEICET
2007
15 years 4 months ago
2007
—When SA is applied to continuous optimization problems, the design of the neighborhood used in SA becomes important. A lot of experiments are necessary to determine an appropria...
157
click to vote
MVA
2007
15 years 3 months ago
2007
The majority of existing tracking algorithms are based on the maximum a posteriori (MAP) solution of a probabilistic framework using a Hidden Markov Model, where the distribution ...