We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...
Minimalism pursues the following agenda: For a given robotics task, nd the minimal con guration of resources required to solve the task. Thus, minimalism attempts to reduce the re...