Sciweavers

1612 search results - page 49 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
SLS
2007
Springer
117views Algorithms» more  SLS 2007»
15 years 3 months ago
An Algorithm Portfolio for the Sub-graph Isomorphism Problem
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
Roberto Battiti, Franco Mascia
WSC
2007
15 years 2 days ago
A method for fast generation of bivariate Poisson random vectors
It is well known that trivariate reduction — a method to generate two dependent random variables from three independent random variables — can be used to generate Poisson rand...
Kaeyoung Shin, Raghu Pasupathy
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
14 years 11 months ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan
INFOCOM
2007
IEEE
15 years 4 months ago
Performance of Random Access Scheduling Schemes in Multi-Hop Wireless Networks
Abstract— The performance of scheduling schemes in multihop wireless networks has attracted significant attention in the recent literature. It is well known that optimal schedul...
Changhee Joo, Ness B. Shroff
PDCAT
2007
Springer
15 years 3 months ago
High Throughput Multi-port MT19937 Uniform Random Number Generator
ct There have been many previous attempts to accelerate MT19937 using FPGAs but we believe that we can substantially improve the previous implementations to develop a higher throug...
Vinay Sriram, David Kearney