Sciweavers

1120 search results - page 78 / 224
» Eager Markov Chains
Sort
View
ICML
2004
IEEE
16 years 7 months ago
Learning random walk models for inducing word dependency distributions
Many NLP tasks rely on accurately estimating word dependency probabilities P(w1|w2), where the words w1 and w2 have a particular relationship (such as verb-object). Because of the...
Kristina Toutanova, Christopher D. Manning, Andrew...
IPPS
2008
IEEE
16 years 18 days ago
Reducing the run-time of MCMC programs by multithreading on SMP architectures
The increasing availability of multi-core and multiprocessor architectures provides new opportunities for improving the performance of many computer simulations. Markov Chain Mont...
Jonathan M. R. Byrd, Stephen A. Jarvis, A. H. Bhal...
SIGMETRICS
2006
ACM
121views Hardware» more  SIGMETRICS 2006»
16 years 4 days ago
Transient analysis of tree-Like processes and its application to random access systems
A new methodology to assess transient performance measures of tree-like processes is proposed by introducing the concept of tree-like processes with marked time epochs. As opposed...
Jeroen Van Velthoven, Benny Van Houdt, Chris Blond...
MASCOTS
1994
15 years 7 months ago
Xmgm: Performance Modeling Using Matrix Geometric Techniques
Over the last two decades a considerable amount of effort has been put in the development and application of matrix geometric techniques for the analysis of queueing systems of wh...
Boudewijn R. Haverkort, Aad P. A. van Moorsel, Dir...
CORR
2010
Springer
189views Education» more  CORR 2010»
15 years 6 months ago
Approaching Throughput-optimality in Distributed CSMA Scheduling Algorithms with Collisions
Abstract--It was shown recently that carrier sense multiple access (CSMA)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing n...
Libin Jiang, Jean C. Walrand