SAC
2012
ACM
12 years 8 months ago
2012
ACM
SAC
2012
ACM
12 years 8 months ago
2012
ACM
In this paper, we present the use of Markov Chain Monte Carlo (MCMC) methods to attack the classical ciphers. We use frequency analysis as our basic tool. First we investigate the...
SAC
2012
ACM
12 years 8 months ago
2012
ACM
SAC
2012
ACM
12 years 8 months ago
2012
ACM
Data cloning method is a new computational tool for computing maximum likelihood estimates in complex statistical models such as mixed models. This method is synthesized with inte...
SAC
2012
ACM
12 years 8 months ago
2012
ACM
GC
2012
Springer
12 years 8 months ago
2012
Springer
A cut [X, V − X] in a hypergraph with vertex-set V is the set of all edges that meet both X and V − X. Let sr(n) denote the minimum total size of any cover of the edges of the ...
COMGEO
2012
ACM
12 years 8 months ago
2012
ACM
The problem of reconstructing a region from a set of sample points is common in many geometric applications, including computer vision. It is very helpful to be able to guarantee ...
COMGEO
2012
ACM
12 years 8 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
COMGEO
2012
ACM
12 years 8 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
COMGEO
2012
ACM
12 years 8 months ago
2012
ACM
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...