Sciweavers

4007 search results - page 99 / 802
» Computation with imprecise probabilities
Sort
View
88
Voted
ICDT
2007
ACM
87views Database» more  ICDT 2007»
15 years 6 months ago
Query Evaluation on a Database Given by a Random Graph
We consider random graphs, and their extensions to random structures, with edge probabilities of the form βn−α , where n is the number of vertices, α, β are fixed and α >...
Nilesh N. Dalvi
94
Voted
IVCNZ
1998
15 years 1 months ago
On Comparing Two Scenarios for Probabilistic Image Modelling
Traditional scenario of probabilistic modelling is directed at generating samples having a given probability distribution. We argue that this scenario is impracticable for image m...
Georgy L. Gimel'farb
KDD
2012
ACM
205views Data Mining» more  KDD 2012»
13 years 3 months ago
From user comments to on-line conversations
We present an analysis of user conversations in on-line social media and their evolution over time. We propose a dynamic model that predicts the growth dynamics and structural pro...
Chunyan Wang, Mao Ye, Bernardo A. Huberman
101
Voted
IPSN
2005
Springer
15 years 6 months ago
Geographic routing with limited information in sensor networks
Geographic routing with greedy relaying strategies have been widely studied as a routing scheme in sensor networks. These schemes assume that the nodes have perfect information ab...
Sundar Subramanian, Sanjay Shakkottai
WSNA
2003
ACM
15 years 5 months ago
Cleaning and querying noisy sensors
Sensor networks have become an important source of data with numerous applications in monitoring various real-life phenomena as well as industrial applications and traffic contro...
Eiman Elnahrawy, Badri Nath