Sciweavers

1510 search results - page 65 / 302
» Upper Probabilities and Additivity
Sort
View
TKDE
2010
184views more  TKDE 2010»
14 years 8 months ago
The Dynamic Bloom Filters
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...
Deke Guo, Jie Wu, Honghui Chen, Ye Yuan, Xueshan L...
CORR
2011
Springer
210views Education» more  CORR 2011»
14 years 4 months ago
Statistical Compressed Sensing of Gaussian Mixture Models
A novel framework of compressed sensing, namely statistical compressed sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical distribu...
Guoshen Yu, Guillermo Sapiro
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
15 years 11 months ago
Efficient Query Processing in Large Traffic Networks
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
RSKT
2007
Springer
15 years 3 months ago
Decision-Theoretic Rough Set Models
Abstract. Decision-theoretic rough set models are a probabilistic extension of the algebraic rough set model. The required parameters for defining probabilistic lower and upper ap...
Yiyu Yao
WECWIS
2005
IEEE
87views ECommerce» more  WECWIS 2005»
15 years 3 months ago
TrustDavis: A Non-Exploitable Online Reputation System
We present TrustDavis, an online reputation system that provides insurance against trade fraud by leveraging existing relationships between players, such as the ones present in so...
Dimitri do B. DeFigueiredo, Earl T. Barr