Sciweavers

1449 search results - page 36 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
DAGSTUHL
2006
15 years 1 months ago
Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems
In this paper we study a class of dynamical systems defined by Pfaffian maps. It is a sub-class of o-minimal dynamical systems which capture rich continuous dynamics and yet can be...
Margarita V. Korovina, Nicolai Vorobjov
93
Voted
FOCS
1990
IEEE
15 years 4 months ago
Complexity of Unification in Free Groups and Free Semi-groups
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...
Antoni Koscielski, Leszek Pacholski
SIGMOD
1998
ACM
93views Database» more  SIGMOD 1998»
15 years 4 months ago
Efficiently Mining Long Patterns from Databases
We present a pattern-mining algorithm that scales roughly linearly in the number of maximal patterns embedded in a database irrespective of the length of the longest pattern. In c...
Roberto J. Bayardo Jr.
101
Voted
ATVA
2006
Springer
106views Hardware» more  ATVA 2006»
15 years 4 months ago
Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains
Motivated by recent applications of pushdown systems to computer security problems, we present an efficient algorithm for the reachability problem of alternating pushdown systems. ...
Dejvuth Suwimonteerabuth, Stefan Schwoon, Javier E...
99
Voted
AAAI
1997
15 years 1 months ago
Worst-Case Absolute Loss Bounds for Linear Learning Algorithms
The absolute loss is the absolute difference between the desired and predicted outcome. I demonstrateworst-case upper bounds on the absolute loss for the perceptron algorithm and ...
Tom Bylander