Sciweavers

515 search results - page 59 / 103
» Approximating Markov Processes by Averaging
Sort
View
IPPS
2010
IEEE
15 years 4 months ago
On the parallelisation of MCMC by speculative chain execution
Abstract--The increasing availability of multi-core and multiprocessor architectures provides new opportunities for improving the performance of many computer simulations. Markov C...
Jonathan M. R. Byrd, Stephen A. Jarvis, Abhir H. B...
ICDAR
1999
IEEE
15 years 10 months ago
Partitioning and Searching Dictionary for Correction of Optically Read Devanagari Character Strings
Abstract. This paper describes a method for correction of optically read Devanagari character strings using a Hindi word dictionary. The word dictionary is partitioned in order to ...
Veena Bansal, R. M. K. Sinha
INFOCOM
2006
IEEE
16 years 4 days ago
Constant-Complexity Models for Wireless Channels
— High-order full-state Markov (FSM) chains have been employed to model errors and losses in many wireless studies. The complexity of this modeling paradigm is an exponential fun...
Syed A. Khayam, Hayder Radha
INFOCOM
2003
IEEE
15 years 11 months ago
Asymptotic Insensitivity of Least-Recently-Used Caching to Statistical Dependency
Abstract— We investigate a widely popular Least-RecentlyUsed (LRU) cache replacement algorithm with semi-Markov modulated requests. Semi-Markov processes provide the flexibility...
Predrag R. Jelenkovic, Ana Radovanovic
CAV
2010
Springer
190views Hardware» more  CAV 2010»
15 years 9 months ago
Measuring and Synthesizing Systems in Probabilistic Environments
Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order...
Krishnendu Chatterjee, Thomas A. Henzinger, Barbar...