Sciweavers

336 search results - page 7 / 68
» Effective Randomness for Computable Probability Measures
Sort
View
GRC
2008
IEEE
13 years 8 months ago
Effects of Varying the Delay Distribution in Random, Scale-free, and Small-world Networks
Graph-theory-based approaches have been used with great success when analyzing abstract properties of natural and artificial networks. However, these approaches have not factored...
Bum Soon Jang, Timothy Mann, Yoonsuck Choe
ISIPTA
2005
IEEE
130views Mathematics» more  ISIPTA 2005»
14 years 1 months ago
Computing Lower and Upper Expectations under Epistemic Independence
This papers investigates the computation of lower/upper expectations that must cohere with a collection of probabilistic assessments and a collection of judgements of epistemic in...
Cassio Polpo de Campos, Fabio Gagliardi Cozman
PKDD
2005
Springer
101views Data Mining» more  PKDD 2005»
14 years 28 days ago
A Random Method for Quantifying Changing Distributions in Data Streams
In applications such as fraud and intrusion detection, it is of great interest to measure the evolving trends in the data. We consider the problem of quantifying changes between tw...
Haixun Wang, Jian Pei
AIPS
2009
13 years 8 months ago
Computing Robust Plans in Continuous Domains
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
Christian Fritz, Sheila A. McIlraith
WAW
2004
Springer
150views Algorithms» more  WAW 2004»
14 years 24 days ago
Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
Paolo Boldi, Massimo Santini, Sebastiano Vigna