Sciweavers

993 search results - page 177 / 199
» The Complexity of Probabilistic EL
Sort
View
SIGMOD
2008
ACM
169views Database» more  SIGMOD 2008»
14 years 7 months ago
MCDB: a monte carlo approach to managing uncertain data
To deal with data uncertainty, existing probabilistic database systems augment tuples with attribute-level or tuple-level probability values, which are loaded into the database al...
Ravi Jampani, Fei Xu, Mingxi Wu, Luis Leopoldo Per...
ICRA
2008
IEEE
150views Robotics» more  ICRA 2008»
14 years 2 months ago
A Bayesian approach to empirical local linearization for robotics
— Local linearizations are ubiquitous in the control of robotic systems. Analytical methods, if available, can be used to obtain the linearization, but in complex robotics system...
Jo-Anne Ting, Aaron D'Souza, Sethu Vijayakumar, St...
NDSS
2008
IEEE
14 years 2 months ago
Usable PIR
In [22] we showed that existing single-server computational private information retrieval (PIR) protocols for the purpose of preserving client access patterns leakage are orders o...
Peter Williams, Radu Sion
IROS
2007
IEEE
175views Robotics» more  IROS 2007»
14 years 2 months ago
Simulation and weights of multiple cues for robust object recognition
Reliable recognition of objects is an important capabaility in the progress towards getting agents to accomplish and assist in a variety of useful tasks such as search and rescue ...
Sarah Aboutalib, Manuela M. Veloso
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
14 years 1 months ago
On Secure Multi-party Computation in Black-Box Groups
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxio...