LATIN
2010
Springer
13 years 11 months ago
2010
Springer
LATIN
2010
Springer
13 years 11 months ago
2010
Springer
LATIN
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We describe algorithms for finding the regression of t, a sequence of values, to the closest sequence s by mean squared error, so that s is always increasing (isotonicit...
LATIN
2010
Springer
13 years 11 months ago
2010
Springer
LATIN
2010
Springer
13 years 11 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
LATIN
2010
Springer
13 years 11 months ago
2010
Springer
LATIN
2010
Springer
13 years 11 months ago
2010
Springer
LATIN
2010
Springer
13 years 11 months ago
2010
Springer
We study the error robustness of tilings of the plane. The fundamental question is the following: given a tileset, what happens if we allow a small probability of errors? Are the o...
LATIN
2010
Springer
13 years 11 months ago
2010
Springer
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...
LATIN
2010
Springer
13 years 11 months ago
2010
Springer
We study the following geometric hypergraph coloring problem: given a planar point set and an integer k, we wish to color the points with k colors so that any axis-aligned strip co...