|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 12 occurrences of 12 keywords
|
|
|
|
|
Results
Found 15 publication records. Showing 15 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Mark Huber, Sarah Schott |
Random construction of interpolating sets for high dimensional integration  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Saurabh Gupta, Robert P. Bostrom, Mark Huber |
End-user training methods: what we know, need to know.  |
DATA BASE  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Quyen L. Nguyen, Alla Lake, Mark Huber |
Content Server Architecture Pattern for Evolvability and Scalability.  |
ICSEA  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jane Webster, Marie-Claude Boudreau, Brian Donnellan, Steve Elliot, Mark Huber, Tracy A. Jenkin, Charles Sheridan |
Panel: A call for action in tackling environmental sustainability through green information technologies and systems.  |
ECIS  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Mark Huber |
Perfect simulation with exponential tails on the running time.  |
Random Struct. Algorithms  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Huber, Jenny Law |
Fast approximation of the permanent for very dense problems.  |
SODA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Huber |
Fast perfect sampling from linear extensions.  |
Discrete Mathematics  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Huber |
Exact Sampling from Perfect Matchings of Dense Regular Bipartite Graphs.  |
Algorithmica  |
2006 |
DBLP DOI BibTeX RDF |
Perfect sampling, Bregman's theorem, Minc's conjecture, Approximation algorithms, Perfect matchings, Permanent |
| 1 | Mark Huber, Alla Lake, Robert Chadduck |
NARA's Electronic Records Archive (ERA) - The Electronic Records Challenge.  |
MSST  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Mark Huber |
A bounding chain for Swendsen-Wang.  |
Random Struct. Algorithms  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | David Salisbury, Mark Huber, Craig Piercy |
Panel Session on IS 2002.1 - Fundamentals of Information Systems.  |
AMCIS  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Mark Huber |
A faster method for sampling independent sets.  |
SODA  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | James Allen Fill, Mark Huber |
The Randomness Recycler: A New Technique for Perfect Sampling.  |
FOCS  |
2000 |
DBLP DOI BibTeX RDF |
randomness recycler, perfect sampling, approximately random samples, output samples, target distribution, classical Markov chain approaches, RR-based algorithm, perfect sampling methods, restricted instances, first expected linear time algorithms, sample generation, self-organizing lists, random independent sets, random colorings, random cluster model, RR protocol, graph theory, probability, Markov chains, probability distributions, random processes, mixing time, sampling methods, Ising model, self-adjusting systems |
| 1 | Mark Huber |
Efficient Exact Sampling from the Ising Model Using Swendsen-Wang.  |
SODA  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Huber |
Exact Sampling and Approximate Counting Techniques.  |
STOC  |
1998 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #15 of 15 (100 per page; Change: )
|
|