Sciweavers

440 search results - page 59 / 88
» On partial randomness
Sort
View
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
15 years 11 months ago
Approximate Confidence Computation in Probabilistic Databases
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
Dan Olteanu, Jiewen Huang, Christoph Koch
DCC
2005
IEEE
15 years 11 months ago
Elliptic Curve Cryptosystems in the Presence of Permanent and Transient Faults
Elliptic curve cryptosystems in the presence of faults were studied by Biehl, Meyer and M?uller (2000). The first fault model they consider requires that the input point P in the c...
Mathieu Ciet, Marc Joye
SODA
2010
ACM
157views Algorithms» more  SODA 2010»
15 years 9 months ago
Testing monotone high-dimensional distributions
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
Ronitt Rubinfeld, Rocco A. Servedio
CVPR
2010
IEEE
15 years 8 months ago
Modeling Mutual Context of Object and Human Pose in Human-Object Interaction Activities
Detecting objects in cluttered scenes and estimating articulated human body parts are two challenging problems in computer vision. The difficulty is particularly pronounced in ac...
Bangpeng Yao, Li Fei-Fei
WEA
2009
Springer
139views Algorithms» more  WEA 2009»
15 years 6 months ago
Fast Algorithm for Graph Isomorphism Testing
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
José Luis López-Presa, Antonio Fern&...