2040 search results - page 75 / 408 » Approximate Expectation Maximization |
ICML
2003
IEEE
16 years 10 days ago
2003
IEEE
When the goal is to achieve the best correct classification rate, cross entropy and mean squared error are typical cost functions used to optimize classifier performance. However,...
EOR
2007
14 years 11 months ago
2007
Classical vehicle routing problems typically do not consider the impact of delivery price on the demand for delivery services. Existing models seek the minimum sum of tour lengths...
102
click to vote
SODA
2004
ACM
15 years 27 days ago
2004
ACM
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
116
click to vote
FSE
2003
Springer
15 years 4 months ago
2003
Springer
We present our further observations on the structure of the AES algorithm relating to the cyclic properties of the functions used in this cipher. We note that the maximal period of...
104
click to vote
WADS
2005
Springer
15 years 5 months ago
2005
Springer
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for â...