We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
: This paper considers differential linear repetitive processes which are a distinct class of 2D systems whose dynamics evolve over a subset of the upper right quadrant of the 2D p...
Pawel Grzegorz Dabkowski, Krzysztof Galkowski, Eri...
When gathering feedback about an envisioned system, prototypes communicate design ideas to user groups. However, it is unclear how user responses are affected by prototype format....
Katherine M. Sellen, Micheal Massimi, Danielle M. ...
Many settings of unsupervised learning can be viewed as quantization problems — the minimization of the expected quantization error subject to some restrictions. This allows the ...
Alex J. Smola, Robert C. Williamson, Sebastian Mik...