|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3 occurrences of 3 keywords
|
|
|
|
|
Results
Found 9 publication records. Showing 9 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Nikolai Slobodianik, Dmitry Zaporozhets, Neal Madras |
Strong Limit Theorems for the Bayesian Scoring Criterion in Bayesian Networks.  |
Journal of Machine Learning Research  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Neal Madras, C. Chris Wu |
Self-Avoiding Walks on Hyperbolic Graphs. |
Combinatorics, Probability & Computing |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Neal Madras, Zhongrong Zheng |
On the swapping algorithm. |
Random Struct. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Neal Madras, Dana Randall |
Factoring Graphs to Bound Mixing Rates. |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
mixing rate bounding, state space decomposition, Monte Carlo Markov chain algorithm, random three-colorings, 2-dimensional lattice regions, 3-state Potts model, ice model, Metropolis sampling algorithm, factorization theorems, Markov chain, Markov processes, statistical mechanics |
| 1 | Albert G. Greenberg, Neal Madras |
How Fair is Fair Queuing? |
J. ACM |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Albert G. Greenberg, Neal Madras |
Comparison of a Fair Queueing Discipline to Processor Sharing. |
Performance |
1990 |
DBLP BibTeX RDF |
|
| 1 | Richard M. Karp, Michael Luby, Neal Madras |
Monte-Carlo Approximation Algorithms for Enumeration Problems. |
J. Algorithms |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan Goodman, Albert G. Greenberg, Neal Madras, Peter March |
Stability of binary exponential backoff. |
J. ACM |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan Goodman, Albert G. Greenberg, Neal Madras, Peter March |
On the Stability of the Ethernet |
STOC |
1985 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #9 of 9 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")