4103 search results - page 95 / 821 » Some results on the Collatz problem |
174
click to vote
COLT
1999
Springer
15 years 10 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
144
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
169
click to vote
FCT
2005
Springer
16 years 6 hour ago
2005
Springer
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. ...
158
click to vote
ICIP
2002
IEEE
16 years 8 months ago
2002
IEEE
In this paper, we consider an X ray computed tomography (CT) image reconstruction problem using two different kinds of data: classical X-rays radiographic data and some geometrica...
170
click to vote
FSTTCS
2007
Springer
16 years 19 days ago
2007
Springer
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b 2. The aim is to nd a minimum weight spannin...