Multi-dimensional map-folding

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Map Folding

A crease pattern is an embedded planar graph on a piece of paper. An m×n map is a rectangular piece of paper with a crease pattern that partitions the paper into an m×n regular grid of unit squares. If a map has a configuration such that all the faces of the map are stacked on a unit square and the paper does not self-intersect, then it is flat foldable, and the linear ordering of the faces is ...

متن کامل

Map Folding by Tom Morgan

The idea of the ray diagram was introduced by David Charlton, and further elaborated by Yoyo Zhou, in the context of an open problem session held as part of an MIT class 6.885 on Geometric Folding Algorithms in Fall 2007. I thank the participants of that open problem session for helpful early discussions about 2 × n map folding. I would also like to thank Eric Liu for his close help in the earl...

متن کامل

Multi-dimensional Parametric Mincuts for Constrained MAP Inference

In this paper, we propose novel algorithms for inferring the Maximum a Posteriori (MAP) solution of discrete pairwise random field models under multiple constraints. We show how this constrained discrete optimization problem can be formulated as a multi-dimensional parametric mincut problem via its Lagrangian dual, and prove that our algorithm isolates all constraint instances for which the pro...

متن کامل

Folding a Tree into a Map

Analysis of the retrieval architecture of the highly influential UNIX file system ([1][2]) provides insight into design methods, constraints, and possible alternatives. The basic architecture can be understood in terms of function composition and recursion by anyone with some mathematical maturity. Expertise in operating system coding or in any specialized “formal method” is not required.

متن کامل

Protein Folding in Contact Map Space

We represent a protein's structure by its contact map. Our aim is to identify the unknown fold of a known sequence by minimizing a (free) energy deened in the space of contact maps. To this end we developed an eecient method to search this space and to generate low energy maps that are also physical. We proved that the standard pairwise approximation to the free energy is unable to stabilize th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Computer Journal

سال: 1971

ISSN: 0010-4620,1460-2067

DOI: 10.1093/comjnl/14.1.75