Sciweavers

7311 search results - page 259 / 1463
» Time in State Machines
Sort
View
COMPGEOM
2009
ACM
16 years 1 months 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
DISCO
1993
156views Hardware» more  DISCO 1993»
15 years 11 months ago
Variant Handling, Inheritance and Composition in the ObjectMath Computer Algebra Environment
ObjectMath is a high-level programming environment and modeling language for scientific computing which supports variants and graphical browsing in the environment and integrates o...
Peter Fritzson, Vadim Engelson, Lars Viklund
DRM
2006
Springer
15 years 11 months ago
Securing sensitive content in a view-only file system
One of the most fundamental problems in computer security is protecting sensitive digital information from unauthorized disclosure. There are a number of challenges, such as spywa...
Kevin Borders, Xin Zhao, Atul Prakash
ALT
2010
Springer
15 years 8 months ago
A Lower Bound for Learning Distributions Generated by Probabilistic Automata
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability
Borja Balle, Jorge Castro, Ricard Gavaldà
IPL
1998
68views more  IPL 1998»
15 years 7 months ago
Fast Nondeterministic Recognition of Context-Free Languages Using two Queues
We show how to accept a context-free language nondeterministically in O( n log n) time on a two-queue machine.
Burton Rosenberg