Tiling randomness

نویسندگان

چکیده

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

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

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

منابع مشابه

Optimal Tiling

Iteration space tiling is a common strategy used by parallelizing compilers to reduce communication overhead. We address the problem of determining the optimal tile size (which minimizes the total execution time of the program), for a particular program schema. We use a realistic model of the architecture which accounts for coprocessors that permit overlapping of communication and computation, ...

متن کامل

Tiling Databases

In this paper, we consider 0/1 databases and provide an alternative way of extracting knowledge from such databases using tiles. A tile is a region in the database consisting solely of ones. The interestingness of a tile is measured by the number of ones it consists of, i.e., its area. We present an efficient method for extracting all tiles with area at least a given threshold. A collection of ...

متن کامل

Tiling Problems

The undecidable problems we saw at the start of our unit on undecidability were all questions about the behavior of computer programs. But in fact there are many decision problems which, on the surface, have nothing to do with computer programs yet can still be proved to have no algorithmic solution. One of these is a tiling problem. Imagine square tiles divided into colored triangular quadrants.

متن کامل

Shape tiling

definition of packing and tiling.) Two recent papers by Freiling & Rinne 1994, and by Laczkovich & Szekeres 1995, turn the question around: For which sidelengths, s, can the square be packed by rectangles similar to 1 × s and s × 1? Employing a Dehn-functional and a theorem of Wall1945, they give this astonishing answer: Iff s is algebraic over , and all of its conjugates in the complex plane h...

متن کامل

Ranked Tiling

Tiling is a well-known pattern mining technique. Traditionally, it discovers large areas of ones in binary databases or matrices, where an area is defined by a set of rows and a set of columns. In this paper, we introduce the novel problem of ranked tiling, which is concerned with finding interesting areas in ranked data. In this data, each transaction defines a complete ranking of the columns....

متن کامل

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


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

ژورنال

عنوان ژورنال: Nature Materials

سال: 2011

ISSN: 1476-1122,1476-4660

DOI: 10.1038/nmat3218