Sciweavers

1450 search results - page 48 / 290
» On the Complexity of Hardness Amplification
Sort
View
ECCV
2004
Springer
14 years 1 months ago
Combining Simple Models to Approximate Complex Dynamics
Stochastic tracking of structured models in monolithic state spaces often requires modeling complex distributions that are difficult to represent with either parametric or sample...
Leonid Taycher, John W. Fisher III, Trevor Darrell
ECBS
2002
IEEE
119views Hardware» more  ECBS 2002»
14 years 21 days ago
Managing Complex Temporal Requirements in Real-Time Control Systems
Design and implementation of motion control applications includes the transition from control design to real-time system implementation. To make this transition smooth, the specif...
Kristian Sandström, Christer Norström
STOC
1999
ACM
176views Algorithms» more  STOC 1999»
14 years 1 days ago
On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
Johannes Blömer, Jean-Pierre Seifert
HYBRID
2000
Springer
13 years 11 months ago
Towards Procedures for Systematically Deriving Hybrid Models of Complex Systems
Abstract. In many cases, complex system behaviors are naturally modeled as nonlinear differential equations. However, these equations are often hard to analyze because of "sti...
Pieter J. Mosterman, Gautam Biswas
ENTCS
2006
153views more  ENTCS 2006»
13 years 7 months ago
Automatic Complexity Analysis for Programs Extracted from Coq Proof
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
Jean-Pierre Jouannaud, Weiwen Xu