Sciweavers

748 search results - page 80 / 150
» Time and Probability in Process Algebra
Sort
View
100
Voted
NAACL
2001
15 years 1 months ago
A Probabilistic Earley Parser as a Psycholinguistic Model
In human sentence processing, cognitive load can be defined many ways. This report considers a definition of cognitive load in terms of the total probability of structural options...
John Hale
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 19 days ago
Random Information Spread in Networks
Let G = (V, E) be an undirected loopless graph with possible parallel edges and s, t V . Assume that s is labelled at the initial time step and that every labelled vertex copies i...
Raymond Lapus, Frank Simon, Peter Tittmann
SODA
2010
ACM
197views Algorithms» more  SODA 2010»
15 years 10 months ago
Quasirandom Load Balancing
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
AVSS
2009
IEEE
15 years 3 months ago
Bayesian Bio-inspired Model for Learning Interactive Trajectories
—Automatic understanding of human behavior is an important and challenging objective in several surveillance applications. One of the main problems of this task consists in accur...
Alessio Dore, Carlo S. Regazzoni
QUESTA
2007
50views more  QUESTA 2007»
15 years 1 days ago
Stability of join-the-shortest-queue networks
This paper investigates stability behavior in a variant of a generalized Jackson queueing network. In our network, some customers use a join-the-shortest-queue policy when enterin...
J. G. Dai, John J. Hasenbein, Bara Kim