534 search results - page 21 / 107 » Efficient polynomial L-approximations |
ALT
2003
Springer
13 years 11 months ago
2003
Springer
Due to the rapid growth of tree structured data such as Web documents, efficient learning from tree structured data becomes more and more important. In order to represent structura...
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
We present a kinetic data structure for maintaining a (1+ )-spanner of size O(n/2 ) for a set of n moving points in the plane. Assuming the trajectories of the points can be descr...
IPL
2008
13 years 7 months ago
2008
Quasi-reversible automata is a suitable representation for reversible languages. In this work a method is proposed to obtain such an automaton for any given reversible language re...
TCC
2010
Springer
13 years 5 months ago
2010
Springer
We revisit the composability of different forms of zero-knowledge proofs when the honest prover strategy is restricted to be polynomial time (given an appropriate auxiliary input)...
MCS
2008
Springer
13 years 7 months ago
2008
Springer
In the stability study of nonlinear systems, not to found feasible solution for the LMI problem associated with a quadratic Lyapunov function shows that it doesn't exist posi...