Sciweavers

2766 search results - page 384 / 554
» Algorithms for trigonometric polynomials
Sort
View
HYBRID
2004
Springer
15 years 9 months ago
Inference Methods for Autonomous Stochastic Linear Hybrid Systems
We present a parameter inference algorithm for autonomous stochastic linear hybrid systems, which computes a maximum-likelihood model, given only a set of continuous output data of...
Hamsa Balakrishnan, Inseok Hwang, Jung Soon Jang, ...
STOC
1999
ACM
176views Algorithms» more  STOC 1999»
15 years 8 months 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
PODC
1990
ACM
15 years 8 months ago
Sharing Memory Robustly in Message-Passing Systems
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
Hagit Attiya, Amotz Bar-Noy, Danny Dolev
167
Voted
CCS
2007
ACM
15 years 8 months ago
Efficient policy analysis for administrative role based access control
Administrative RBAC (ARBAC) policies specify how Role-Based Access Control (RBAC) policies may be changed by each administrator. It is often difficult to fully understand the effe...
Scott D. Stoller, Ping Yang, C. R. Ramakrishnan, M...
CIDM
2007
IEEE
15 years 8 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...