Sciweavers

111 search results - page 17 / 23
» The Hamiltonian p-Median Problem
Sort
View
DAM
2007
107views more  DAM 2007»
13 years 11 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
ACSAC
2003
IEEE
14 years 4 months ago
Automatic Reassembly of Document Fragments via Context Based Statistical Models
Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent...
Kulesh Shanmugasundaram, Nasir D. Memon
STOC
2009
ACM
107views Algorithms» more  STOC 2009»
14 years 11 months ago
Efficient discrete-time simulations of continuous-time quantum query algorithms
The continuous-time query model is a variant of the discrete query model in which queries can be interleaved with known operations (called "driving operations") continuo...
Richard Cleve, Daniel Gottesman, Michele Mosca, Ro...
SAC
2009
ACM
14 years 5 months ago
Bulk based preconditioning for quantum dot computations
Abstract— This article describes how to accelerate the convergence of Preconditioned Conjugate Gradient (PCG) type eigensolvers for the computation of several states around the b...
Christof Vömel, Stanimire Tomov, Osni Marques
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 11 months ago
Asymptotic Learning Curve and Renormalizable Condition in Statistical Learning Theory
Bayes statistics and statistical physics have the common mathematical structure, where the log likelihood function corresponds to the random Hamiltonian. Recently, it was discovere...
Sumio Watanabe