Sciweavers

424 search results - page 32 / 85
» Realizability models and implicit complexity
Sort
View
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 8 months ago
A Spectral Algorithm for Learning Hidden Markov Models
Hidden Markov Models (HMMs) are one of the most fundamental and widely used statistical tools for modeling discrete time series. In general, learning HMMs from data is computation...
Daniel Hsu, Sham M. Kakade, Tong Zhang
FM
2003
Springer
160views Formal Methods» more  FM 2003»
14 years 1 months ago
Translation-Based Compositional Reasoning for Software Systems
Software systems are often model checked by translating them into a directly model-checkable formalism. Any serious software system requires application of compositional reasoning ...
Fei Xie, James C. Browne, Robert P. Kurshan
CRYPTO
2006
Springer
224views Cryptology» more  CRYPTO 2006»
14 years 13 days ago
Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
We present an identity-based cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the...
Xavier Boyen, Brent Waters
HICSS
2006
IEEE
117views Biometrics» more  HICSS 2006»
14 years 2 months ago
Stakeholders, Contradictions and Salience: An Empirical Study of a Norwegian G2G Effort
Previous studies indicate that the expected effects of e-Government are slower to realize than initially expected. Several authors argue that e-Government involves particularly co...
Leif Skiftenes Flak, Stig Nordheim
CADE
2008
Springer
14 years 9 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard