Sciweavers

882 search results - page 86 / 177
» On self-embeddings of computable linear orderings
Sort
View
PARA
2004
Springer
15 years 3 months ago
Performance of Taylor Model Methods for Validated Integration of ODEs
The performance of various Taylor model (TM)-based methods for the validated integration of ODEs is studied for some representative computational problems. For nonlinear problems, ...
Martin Berz, Kyoko Makino
HYBRID
2003
Springer
15 years 3 months ago
Reachability Analysis of Nonlinear Systems Using Conservative Approximation
Abstract. In this paper we present an approach to approximate reachability computation for nonlinear continuous systems. Rather than studying a complex nonlinear system ˙x = g(x),...
Eugene Asarin, Thao Dang, Antoine Girard
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
15 years 2 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
FOCS
2004
IEEE
15 years 1 months ago
Worst-Case to Average-Case Reductions Based on Gaussian Measures
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
Daniele Micciancio, Oded Regev
ICCV
1999
IEEE
15 years 12 months ago
Semantic Organization of Scenes using Discriminant Structural Templates
In this paper, we present a procedure for organizing real world scenes along semantic axes. The approach is based on the output energies of linear discriminant filters that take i...
Antonio B. Torralba, Aude Oliva