Sciweavers

316 search results - page 20 / 64
» On Approximate Majority and Probabilistic Time
Sort
View
VLDB
2005
ACM
109views Database» more  VLDB 2005»
15 years 9 months ago
Model-based approximate querying in sensor networks
Abstract Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" i...
Amol Deshpande, Carlos Guestrin, Samuel Madden, Jo...
93
Voted
ICML
2006
IEEE
15 years 10 months ago
Dynamic topic models
A family of probabilistic time series models is developed to analyze the time evolution of topics in large document collections. The approach is to use state space models on the n...
David M. Blei, John D. Lafferty
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
15 years 9 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
ICNP
2007
IEEE
15 years 3 months ago
A Probabilistic Coverage Protocol for Wireless Sensor Networks
—We propose a new probabilistic coverage protocol (denoted by PCP) that considers probabilistic sensing models. PCP is fairly general and can be used with different sensing model...
Mohamed Hefeeda, Hossein Ahmadi
91
Voted
BMCBI
2007
134views more  BMCBI 2007»
14 years 9 months ago
Efficient pairwise RNA structure prediction using probabilistic alignment constraints in Dynalign
Background: Joint alignment and secondary structure prediction of two RNA sequences can significantly improve the accuracy of the structural predictions. Methods addressing this p...
Arif Ozgun Harmanci, Gaurav Sharma, David H. Mathe...