Sciweavers

2597 search results - page 183 / 520
» On numbers of Davenport-Schinzel sequences
Sort
View
ISAAC
2004
Springer
100views Algorithms» more  ISAAC 2004»
15 years 7 months ago
Boundary-Optimal Triangulation Flooding
Given a planar triangulation all of whose faces are initially white, we study the problem of colouring the faces black one by one so that the boundary between black and white faces...
Richard J. Nowakowski, Norbert Zeh
COLT
2004
Springer
15 years 5 months ago
Minimizing Regret with Label Efficient Prediction
We investigate label efficient prediction, a variant, proposed by Helmbold and Panizza, of the problem of prediction with expert advice. In this variant, the forecaster, after gues...
Nicolò Cesa-Bianchi, Gábor Lugosi, G...
SNPD
2003
15 years 3 months ago
Estimation of Multiple Motions by Block Matching
This paper deals with the problem of estimating multiple motions at points where these motions are overlaid. We present a new approach that is based on block matching and can deal...
Ingo Stuke, Til Aach, Erhardt Barth, Cicero Mota
DM
2008
55views more  DM 2008»
15 years 1 months ago
Improved pebbling bounds
Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A pebbling step consists of removing two pebbles from a given vertex and placing o...
Melody Chan, Anant P. Godbole
CONSTRAINTS
2000
96views more  CONSTRAINTS 2000»
15 years 1 months ago
A Comparison of Traditional and Constraint-based Heuristic Methods on Vehicle Routing Problems with Side Constraints
The vehicle routing problem (VRP) is a variant of the familiar travelling salesperson problem (TSP). In the VRP we are to perform a number of visits, using a number of vehicles of ...
Philip Kilby, Patrick Prosser, Paul Shaw