Sciweavers

854 search results - page 48 / 171
» Abstracting from Failure Probabilities
Sort
View
ML
2008
ACM
150views Machine Learning» more  ML 2008»
15 years 1 months ago
Learning probabilistic logic models from probabilistic examples
Abstract. We revisit an application developed originally using Inductive Logic Programming (ILP) by replacing the underlying Logic Program (LP) description with Stochastic Logic Pr...
Jianzhong Chen, Stephen Muggleton, José Car...
UCS
2007
Springer
15 years 8 months ago
Discriminative Temporal Smoothing for Activity Recognition from Wearable Sensors
Abstract. This paper describes daily life activity recognition using wearable acceleration sensors attached to four different parts of the human body. The experimental data set con...
Jaakko Suutala, Susanna Pirttikangas, Juha Rö...
ASIACRYPT
2010
Springer
15 years 5 hour ago
Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
sion of an extended abstract published in Proceedings of Asiacrypt 2010, Springer-Verlag, 2010. Available from the IACR Cryptology ePrint Archive as Report 2010/474. Beginning wit...
Sarah Meiklejohn, Hovav Shacham, David Mandell Fre...
INFOCOM
2008
IEEE
15 years 8 months ago
Network Routing Topology Inference from End-to-End Measurements
Abstract—Inference of the routing topology and link performance from a node to a set of other nodes is an important component of network monitoring and application design. In thi...
Jian Ni, Haiyong Xie 0002, Sekhar Tatikonda, Yang ...
BIRTHDAY
2003
Springer
15 years 7 months ago
Computational Proof as Experiment: Probabilistic Algorithms from a Thermodynamic Perspective
Abstract. A novel framework for the design and analysis of energy-aware algorithms is presented, centered around a deterministic Bit-level (Boltzmann) Random Access Machine or BRAM...
Krishna V. Palem