g Without a Heuristic: Efficient Use of Abstraction Bradford Larsen, Ethan Burns, Wheeler Ruml Department of Computer Science University of New Hampshire Durham, NH 03824 USA blars...
Bradford John Larsen, Ethan Burns, Wheeler Ruml, R...
Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications rangi...
We propose a new `Mark-Ant-Walk' algorithm for robust and efficient covering of continuous domains by ant-like robots with very limited capabilities. The robots can mark plac...
Eliyahu Osherovich, Vladimir Yanovski, Israel A. W...
—We present a fully automatic face recognition algorithm and demonstrate its performance on the FRGC v2.0 data. Our algorithm is multimodal (2D and 3D) and performs hybrid (featu...
We present algorithms for improved Viterbi decoding for the case of hidden semi-Markov models. By carefully constructing directed acyclic graphs, we pose the decoding problem as t...