BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
mont (7)
carlo (7)
path (6)
find (4)
graph (4)

Stem hamiltonian$ (all stems)

24 papers:

ICALPICALP-v1-2015-GharibianS
Ground State Connectivity of Local Hamiltonians (SG, JS), pp. 617–628.
ICMLICML-2015-Betancourt #monte carlo #scalability
The Fundamental Incompatibility of Scalable Hamiltonian Monte Carlo and Naive Data Subsampling (MB), pp. 533–540.
ICMLICML-2015-ChaoSMS #exponential #integration #monte carlo
Exponential Integration for Hamiltonian Monte Carlo (WLC, JS, DM, FS), pp. 1142–1151.
DATEDATE-2014-BahrebarS #approach #network
Improving hamiltonian-based routing methods for on-chip networks: A turn model approach (PB, DS), pp. 1–4.
STOCSTOC-2014-BerryCCKS #exponential #precise #simulation
Exponential improvement in precision for simulating sparse Hamiltonians (DWB, AMC, RC, RK, RDS), pp. 283–292.
ICMLICML-c1-2014-LanZS #monte carlo
Spherical Hamiltonian Monte Carlo for Constrained Target Distributions (SL, BZ, BS), pp. 629–637.
ICMLICML-c1-2014-Sohl-DicksteinMD #monte carlo
Hamiltonian Monte Carlo Without Detailed Balance (JSD, MM, MRD), pp. 719–726.
ICMLICML-c2-2014-ChenFG #monte carlo #probability
Stochastic Gradient Hamiltonian Monte Carlo (TC, EBF, CG), pp. 1683–1691.
DATEDATE-2013-EbrahimiDP #3d #algorithm #fault tolerance #using
Fault-tolerant routing algorithm for 3D NoC using Hamiltonian path strategy (ME, MD, JP), pp. 1601–1604.
ICMLICML-c3-2013-WangMF #adaptation #monte carlo
Adaptive Hamiltonian and Riemann Manifold Monte Carlo (ZW, SM, NdF), pp. 1462–1470.
ICPRICPR-2012-WangL12a #monte carlo
Hamiltonian Monte Carlo estimator for abrupt motion tracking (FW, ML), pp. 3066–3069.
DATEDATE-2011-GobbatoCG #megamodelling #parallel #scalability
A parallel Hamiltonian eigensolver for passivity characterization and enforcement of large interconnect macromodels (LG, AC, SGT), pp. 26–31.
DATEDATE-2010-YeSP #assessment
Extended Hamiltonian Pencil for passivity assessment and enforcement for S-parameter systems (ZY, LMS, JRP), pp. 1148–1152.
DLTDLT-2010-CarpiD #hybrid #on the #problem
On the Hybrid Cerný-Road Coloring Problem and Hamiltonian Paths (AC, FD), pp. 124–135.
LATALATA-2010-BalanS #incremental #problem
Incremental Building in Peptide Computing to Solve Hamiltonian Path Problem (MSB, PS), pp. 549–560.
LATALATA-2010-Cruz-SantosM #on the #quantum #reduction #satisfiability
On the Hamiltonian Operators for Adiabatic Quantum Reduction of SAT (WCS, GML), pp. 239–248.
DACDAC-2006-WongC #matrix #performance
A fast passivity test for descriptor systems via structure-preserving transformations of Skew-Hamiltonian/Hamiltonian matrix pencils (NW, CKC), pp. 261–266.
ICALPICALP-2005-EfthymiouS #graph #on the #random
On the Existence of Hamiltonian Cycles in Random Intersection Graphs (CE, PGS), pp. 690–701.
SACSAC-2001-HuangH #approach #clustering
Finding a hamiltonian paths in tournaments on clusters — a provably communication-efficient approach (CHH, XH), pp. 549–553.
STOCSTOC-2000-FederMS #graph
Finding long paths and cycles in sparse Hamiltonian graphs (TF, RM, CSS), pp. 524–529.
STOCSTOC-1991-BroderFS
Finding Hidden Hamiltonian Cycles (Extended Abstract) (AZB, AMF, ES), pp. 182–189.
STOCSTOC-1991-Harel #graph #infinity
Hamiltonian Paths in Infinite Graphs (DH), pp. 220–229.
ICALPICALP-1991-Furer #algorithm #graph #performance
An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs (MF), pp. 429–440.
STOCSTOC-1977-AngluinV #algorithm #performance #probability
Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings (DA, LGV), pp. 30–41.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.