Sciweavers

SAC
2012
ACM
12 years 6 months ago
Decrypting classical cipher text using Markov chain Monte Carlo
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...
Jian Chen, Jeffrey S. Rosenthal
SAC
2012
ACM
12 years 6 months ago
A semiparametric Bayesian approach to extreme value estimation
Fernando Ferraz do Nascimento, Dani Gamerman, Hedi...
SAC
2012
ACM
12 years 6 months ago
On a hybrid data cloning method and its application in generalized linear mixed models
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...
Hossein Baghishani, Håvard Rue, Mohsen Moham...
SAC
2012
ACM
12 years 6 months ago
A comparison study of nonparametric imputation methods
Jianhui Ning, Philip E. Cheng
GC
2012
Springer
12 years 6 months ago
Covering Complete Hypergraphs with Cuts of Minimum Total Size
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 ...
Sebastian M. Cioaba, André Kündgen
COMGEO
2012
ACM
12 years 6 months ago
Preserving geometric properties in reconstructing regions from internal and nearby points
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 ...
Ernest Davis
COMGEO
2012
ACM
12 years 6 months ago
Point-set embeddings of plane 3-trees
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...
Rahnuma Islam Nishat, Debajyoti Mondal, Md. Saidur...
COMGEO
2012
ACM
12 years 6 months ago
Routing multi-class traffic flows in the plane
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...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...
COMGEO
2012
ACM
12 years 6 months ago
Algorithms for the edge-width of an embedded graph
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...
Sergio Cabello, Éric Colin de Verdiè...