Sciweavers

2255 search results - page 143 / 451
» Computing a Center-Transversal Line
Sort
View
WSC
2007
15 years 5 months ago
Optimistic parallel discrete event simulation of the event-based transmission line matrix method
In this paper we describe a technique for efficient parallelization of digital wave guide network (DWN) models based on an interpretation of the finite difference time domain (F...
David W. Bauer, Ernest H. Page
107
Voted
NIPS
1998
15 years 4 months ago
A Polygonal Line Algorithm for Constructing Principal Curves
Principal curves have been defined as "self consistent" smooth curves which pass through the "middle" of a d-dimensional probability distribution or data cloud...
Balázs Kégl, Adam Krzyzak, Tam&aacut...
93
Voted
NIPS
1998
15 years 4 months ago
Scheduling Straight-Line Code Using Reinforcement Learning and Rollouts
The execution order of a block of computer instructions can make a difference in its running time by a factor of two or more. In order to achieve the best possible speed, compiler...
Amy McGovern, J. Eliot B. Moss
151
Voted
AROBOTS
2002
91views more  AROBOTS 2002»
15 years 3 months ago
Fast, On-Line Learning of Globally Consistent Maps
To navigate in unknown environments, mobile robots require the ability to build their own maps. A major problem for robot map building is that odometry-based dead reckoning cannot ...
Tom Duckett, Stephen Marsland, Jonathan Shapiro
152
Voted
BIRTHDAY
2010
Springer
15 years 4 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
Martin Grohe