Sciweavers

457 search results - page 52 / 92
» Upper and Lower Bounds on Continuous-Time Computation
Sort
View
COMPGEOM
2009
ACM
16 years 19 days ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
SCN
2004
Springer
102views Communications» more  SCN 2004»
15 years 11 months ago
On the Size of Monotone Span Programs
Abstract. Span programs provide a linear algebraic model of computation. Monotone span programs (MSP) correspond to linear secret sharing schemes. This paper studies the properties...
Ventzislav Nikov, Svetla Nikova, Bart Preneel
SIAMNUM
2010
114views more  SIAMNUM 2010»
15 years 26 days ago
A Posteriori Error Estimation Based on Potential and Flux Reconstruction for the Heat Equation
We derive a posteriori error estimates for the discretization of the heat equation in a unified and fully discrete setting comprising the discontinuous Galerkin, finite volume, mix...
Alexandre Ern, Martin Vohralík
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
15 years 11 months ago
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
Andris Ambainis, Ke Yang
AAAI
2008
15 years 8 months ago
An Efficient Motion Planning Algorithm for Stochastic Dynamic Systems with Constraints on Probability of Failure
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
Masahiro Ono, Brian C. Williams