Sciweavers

311 search results - page 2 / 63
» Study of the Probabilistic Information of a Random Set
Sort
View
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
14 years 5 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi
CSDA
2006
71views more  CSDA 2006»
13 years 5 months ago
Practical representations of incomplete probabilistic knowledge
This article deals with the compact representation of incomplete probabilistic knowledge which can be encountered in risk evaluation problems, for instance in environmental studie...
Cédric Baudrit, Didier Dubois
AAAI
2008
13 years 7 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
ECCV
2004
Springer
14 years 7 months ago
Probabilistic Multi-view Correspondence in a Distributed Setting with No Central Server
Abstract. We present a probabilistic algorithm for finding correspondences across multiple images. The algorithm runs in a distributed setting, where each camera is attached to a s...
Shai Avidan, Yael Moses, Yoram Moses
CRYPTO
2008
Springer
150views Cryptology» more  CRYPTO 2008»
13 years 7 months ago
On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
Abstract. The study of deterministic public-key encryption was initiated by Bellare et al. (CRYPTO '07), who provided the "strongest possible" notion of security for...
Alexandra Boldyreva, Serge Fehr, Adam O'Neill