Sciweavers

1523 search results - page 211 / 305
» The Computational Complexity of Linear Optics
Sort
View
LACL
1998
Springer
15 years 8 months ago
Strict Compositionality and Literal Movement Grammars
Abstract. The principle of compositionality, as standardly defined, regards grammars as compositional that are not compositional in an intuitive sense of the word. There is, for ex...
Marcus Kracht
111
Voted
WADS
1997
Springer
91views Algorithms» more  WADS 1997»
15 years 8 months ago
Dynamic Motion Planning in Low Obstacle Density Environments
A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. ...
Robert-Paul Berretty, Mark H. Overmars, A. Frank v...
COLT
2007
Springer
15 years 7 months ago
An Efficient Re-scaled Perceptron Algorithm for Conic Systems
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
Alexandre Belloni, Robert M. Freund, Santosh Vempa...
3DPVT
2004
IEEE
136views Visualization» more  3DPVT 2004»
15 years 7 months ago
Efficient Model Creation of Large Structures based on Range Segmentation
This paper describes an efficient 3D modeling method from 3D range data-sets that is utilizing range data segmentation. Our algorithm starts with a set of unregistered 3D range sc...
Ioannis Stamos, Marius Leordeanu
COLT
2000
Springer
15 years 7 months ago
The Role of Critical Sets in Vapnik-Chervonenkis Theory
In the present paper, we present the theoretical basis, as well as an empirical validation, of a protocol designed to obtain effective VC dimension estimations in the case of a si...
Nicolas Vayatis