417 search results - page 45 / 84 » Generalization Bounds for Some Ordinal Regression Algorithms |
ESA
1998
Springer
14 years 22 days ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
MFCS
2005
Springer
14 years 2 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
ICCV
1998
IEEE
14 years 10 months ago
1998
IEEE
Existing object tracking algorithms generally use some form of local optimisation, assuming that an object's position and shape change smoothly over time. In some situations ...
IWOCA
2009
Springer
14 years 3 months ago
2009
Springer
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...