Sciweavers

16430 search results - page 176 / 3286
» On Computable Tree Functions
Sort
View
CA
2003
IEEE
15 years 9 months ago
A Procedural Approach to Animate Interactive Natural Sceneries
This paper presents a method for animating and rendering an interactive natural scenery in real-time. It improves the prairie model of [11] by enabling the on-the-fly generation ...
Sylvain Guerraz, Frank Perbet, David Raulo, Fran&c...
FOCS
2003
IEEE
15 years 9 months ago
Learning DNF from Random Walks
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...
Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell,...
114
Voted
CAD
1998
Springer
15 years 3 months ago
Knot-removal surface fairing using search strategies
Abstract. This paper presents two automatic fairing algorithms for parametric C2 -continuous bi-cubic B-spline surfaces. The fairing method consists of a knot removal and knot rein...
Stefanie Hahmann, Stefan Konz
IJRR
2010
132views more  IJRR 2010»
15 years 1 months ago
LQR-trees: Feedback Motion Planning via Sums-of-Squares Verification
Advances in the direct computation of Lyapunov functions using convex optimization make it possible to efficiently evaluate regions of attraction for smooth nonlinear systems. Her...
Russ Tedrake, Ian R. Manchester, Mark Tobenkin, Jo...
JUCS
2002
79views more  JUCS 2002»
15 years 3 months ago
Some Notes on Fine Computability
: A metric defined by Fine induces a topology on the unit interval which is strictly stronger than the ordinary Euclidean topology and which has some interesting applications in Wa...
Vasco Brattka