We propose new discrete-to-continuous interpolation models for hexagonally sampled data, that generalize two families of splines developed in the literature for the hexagonal latt...
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
We describe pictographic naming, a new approach to naming for pen-based computers, in which filenames are pictures rather than ASCII strings. Handwriting recognition (HWX) of a n...
The aim of this work is to present a method for rounding quadratically converging algorithms that improves their performance. This method is able to reduce significantly the numbe...
Various stochastic programmingproblemscan be formulated as problems of optimization of an expected value function. Quite often the corresponding expectation function cannot be com...