Sciweavers

4007 search results - page 167 / 802
» Computation with imprecise probabilities
Sort
View
ICML
2007
IEEE
16 years 4 months ago
Sparse probabilistic classifiers
The scores returned by support vector machines are often used as a confidence measures in the classification of new examples. However, there is no theoretical argument sustaining ...
Romain Hérault, Yves Grandvalet
136
Voted
WWW
2004
ACM
16 years 4 months ago
Efficient pagerank approximation via graph aggregation
We present a framework for approximating random-walk based probability distributions over Web pages using graph aggregation. We (1) partition the Web's graph into classes of ...
Andrei Z. Broder, Ronny Lempel, Farzin Maghoul, Ja...
112
Voted
ICALP
2009
Springer
16 years 4 months ago
Reachability in Stochastic Timed Games
We define stochastic timed games, which extend two-player timed games with probabilities (following a recent approach by Baier et al), and which extend in a natural way continuous-...
Patricia Bouyer, Vojtech Forejt
GLOBECOM
2009
IEEE
15 years 10 months ago
Collaborative Quickest Spectrum Sensing via Random Broadcast in Cognitive Radio Systems
Abstract— Quickest detection is applied in the spectrum sensing of cognitive radio systems when multiple secondary users collaborate with limited communication time slots. When t...
Husheng Li, Huaiyu Dai, Chengzhi Li
117
Voted
IICS
2009
Springer
15 years 10 months ago
An Adaptive Policy Routing with Thermal Field Approach
: This paper introduces an adaptive routing approach based on buffer status and distance in a mesh overlay network: Thermal Field is used for considering buffer stage and distance ...
Lada-On Lertsuwanakul, Herwig Unger