Sciweavers

2354 search results - page 101 / 471
» Randomness, Stochasticity and Approximations
Sort
View
ICML
2001
IEEE
14 years 10 months ago
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
We present conditional random fields, a framework for building probabilistic models to segment and label sequence data. Conditional random fields offer several advantages over hid...
John D. Lafferty, Andrew McCallum, Fernando C. N. ...
ICASSP
2009
IEEE
14 years 3 months ago
On the error exponents for detecting randomly sampled noisy diffusion processes
This paper deals with the detection of a continuous random process described by an Ornstein-Uhlenbeck (O-U) stochastic differential equation. Randomly spaced sensors or equivalent...
Walid Hachem, Eric Moulines, Jamal Najim, Fran&cce...
WWW
2004
ACM
14 years 9 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...
AAAI
2010
13 years 10 months ago
Can Approximation Circumvent Gibbard-Satterthwaite?
The Gibbard-Satterthwaite Theorem asserts that any reasonable voting rule cannot be strategyproof. A large body of research in AI deals with circumventing this theorem via computa...
Ariel D. Procaccia
MMB
2001
Springer
141views Communications» more  MMB 2001»
14 years 1 months ago
Performance Analysis of the Random Access Protocol in TETRAPOL Trunked Radio Networks
This paper provides a performance evaluation of the TETRAPOL random access protocol. The results are based on a Markovian model which is also presented. The Markovian model is use...
Dirk Kuypers, Peter Sievering