Results 1  10
of
230,093
Rectangles)
"... We consider the following problem motivated by an application in computational molecular biology. We are given a set of weighted axisparallel rectangles such that for any pair of rectangles and either axis, the projection of one rectangle does not enclose that of the other. Dene a pair to be indepe ..."
Abstract
 Add to MetaCart
We consider the following problem motivated by an application in computational molecular biology. We are given a set of weighted axisparallel rectangles such that for any pair of rectangles and either axis, the projection of one rectangle does not enclose that of the other. Dene a pair
The R*tree: an efficient and robust access method for points and rectangles
 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA
, 1990
"... The Rtree, one of the most popular access methods for rectangles, is based on the heuristic optimization of the area of the enclosing rectangle in each inner node. By running numerous experiments in a standardized testbed under highly varying data, queries and operations, we were able to design the ..."
Abstract

Cited by 1261 (73 self)
 Add to MetaCart
The Rtree, one of the most popular access methods for rectangles, is based on the heuristic optimization of the area of the enclosing rectangle in each inner node. By running numerous experiments in a standardized testbed under highly varying data, queries and operations, we were able to design
The Rectangle Attack  Rectangling the Serpent
 Advances in Cryptology – Proceedings of EUROCRYPT 2001, LNCS 2045
, 2001
"... Serpent is one of the 5 AES finalists. In this paper we present attacks on 7round 8round aid 10round Serpent. The 10round attack is the best known attack on the cipher. The attack enhaimes the amplified boomeraig attack aid uses better differentials. We also present the best 3round, 4round ..."
Abstract

Cited by 69 (15 self)
 Add to MetaCart
Serpent is one of the 5 AES finalists. In this paper we present attacks on 7round 8round aid 10round Serpent. The 10round attack is the best known attack on the cipher. The attack enhaimes the amplified boomeraig attack aid uses better differentials. We also present the best 3round, 4round, 5round aad 6round differential characteristics of Serpent.
The Rectangle Attack Rectangling the Serpent
"... Abstract Serpent is one of the 5 AES finalists. The best attack published so far analyzes up to 9 rounds. In this paper we present attacks on 7round, 8round, and 10round variants of Serpent. We attack a 7round variant with all key lengths, and 8 and 10round variants with 256bit keys. The 10r ..."
Abstract
 Add to MetaCart
Abstract Serpent is one of the 5 AES finalists. The best attack published so far analyzes up to 9 rounds. In this paper we present attacks on 7round, 8round, and 10round variants of Serpent. We attack a 7round variant with all key lengths, and 8 and 10round variants with 256bit keys. The 10
Bent Rectangles ∗
, 804
"... We study generalized regular bent functions using a representation by bent rectangles, that is, special matrices with restrictions on rows and columns. We describe affine transformations of bent rectangles, propose new biaffine and bilinear constructions, study partitions of a vector space into affi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We study generalized regular bent functions using a representation by bent rectangles, that is, special matrices with restrictions on rows and columns. We describe affine transformations of bent rectangles, propose new biaffine and bilinear constructions, study partitions of a vector space
Tiling Rectangles
, 2000
"... Introduction We present a general theorem about tiling rectangles, one corollary being the theorem that, whenever a rectangle is tiled by rectangles each of which has at least one integral side, then the tiled rectangle has at least one integral side. This may be one sixteenth proof for this theore ..."
Abstract
 Add to MetaCart
Introduction We present a general theorem about tiling rectangles, one corollary being the theorem that, whenever a rectangle is tiled by rectangles each of which has at least one integral side, then the tiled rectangle has at least one integral side. This may be one sixteenth proof
in a rectangle
"... Abstract We show that for critical site percolation on the triangular lattice two new observables have conformally invariant scaling limits. In particular the expected number of clusters separating two pairs of points converges to an explicit conformal invariant. Our proof is independent of earlier ..."
Abstract
 Add to MetaCart
results and SLE techniques, and might provide a new approach to establishing conformal invariance of percolation.
Transversals in Rectangles
"... Let L(m; n) be the largest integer such that, if each symbol in an m n rectangle occurs at most L(m; n) times, then the array must have a transversal. We improve the lower bound to L(m; n) m(n m+1) 1 b m ..."
Abstract
 Add to MetaCart
Let L(m; n) be the largest integer such that, if each symbol in an m n rectangle occurs at most L(m; n) times, then the array must have a transversal. We improve the lower bound to L(m; n) m(n m+1) 1 b m
Solving the multipleinstance problem with axisparallel rectangles
 Artificial Intelligence
, 1997
"... ..."
Results 1  10
of
230,093