Results 11  20
of
119,623
Solving the multipleinstance problem with axisparallel rectangles
 Artificial Intelligence
, 1997
"... ..."
On Approximating Rectangle Tiling and Packing
 Proc Symp. on Discrete Algorithms (SODA
"... Our study of tiling and packing with rectangles in twodimensional regions is strongly motivated by applications in database mining, histogrambased estimation of query sizes, data partitioning, and motion estimation in video compression by block matching, among others. An example of the problems tha ..."
Abstract

Cited by 46 (6 self)
 Add to MetaCart
Our study of tiling and packing with rectangles in twodimensional regions is strongly motivated by applications in database mining, histogrambased estimation of query sizes, data partitioning, and motion estimation in video compression by block matching, among others. An example of the problems
Chips on Wafers, or packing rectangles into grids
 Preliminary version in Proc. WADS (Workshop on Algorithms and Data Structures
, 2005
"... A set of rectangles S is said to be grid packed if there exists a rectangular grid (not necessarily regular) such that every rectangle lies in the grid and there is at most one rectangle of S in each cell. The area of a grid packing is the area of a minimal bounding box that contains all the rectang ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A set of rectangles S is said to be grid packed if there exists a rectangular grid (not necessarily regular) such that every rectangle lies in the grid and there is at most one rectangle of S in each cell. The area of a grid packing is the area of a minimal bounding box that contains all
How bad is selfish routing?
 JOURNAL OF THE ACM
, 2002
"... We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge given its congestion; the objective is to route t ..."
Abstract

Cited by 678 (27 self)
 Add to MetaCart
its traffic on the minimumlatency path available to it, given the network congestion caused by the other users. In general such a “selfishly motivated ” assignment of traffic to paths will not minimize the total latency; hence, this lack of regulation carries the cost of decreased network performance
Stee. Absolute approximation ratios for packing rectangles into bins
 Journal of Scheduling
, 2009
"... Abstract. We consider the problem of packing rectangles into bins that are unit squares, where the goal is to minimize the number of bins used. All rectangles have to be packed nonoverlapping and orthogonal, i.e., axisparallel. We present an algorithm with an absolute worstcase ratio of 2 for the ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Abstract. We consider the problem of packing rectangles into bins that are unit squares, where the goal is to minimize the number of bins used. All rectangles have to be packed nonoverlapping and orthogonal, i.e., axisparallel. We present an algorithm with an absolute worstcase ratio of 2
Packing rectangles into 2opt bins using rotations
 In Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT 2008), LNCS 5124
, 2008
"... Abstract. We consider the problem of packing rectangles into bins that are unit squares, where the goal is to minimize the number of bins used. All rectangles can be rotated by 90 degrees and have to be packed nonoverlapping and orthogonal, i.e., axisparallel. We present an algorithm for this probl ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. We consider the problem of packing rectangles into bins that are unit squares, where the goal is to minimize the number of bins used. All rectangles can be rotated by 90 degrees and have to be packed nonoverlapping and orthogonal, i.e., axisparallel. We present an algorithm
Approximation of TwoDimensional Rectangle Packing
, 1999
"... this paper, we look at a slightly more general problem that is primarily motivated by VLSI design. In VLSI design, one wants to pack a given number of rectangles (which might be RAM chips, transistors, etc.) into a wafer of minimum area to reduce the size of the chip. This is the 2d rectangular pac ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
this paper, we look at a slightly more general problem that is primarily motivated by VLSI design. In VLSI design, one wants to pack a given number of rectangles (which might be RAM chips, transistors, etc.) into a wafer of minimum area to reduce the size of the chip. This is the 2d rectangular
Auction Theory: A Guide to the Literature
 JOURNAL OF ECONOMIC SURVEYS
, 1999
"... This paper provides an elementary, nontechnical, survey of auction theory, by introducing and describing some of the critical papers in the subject. (The most important of these are reproduced in a companion book, The Economic Theory of Auctions, Paul Klemperer (ed.), Edward Elgar (pub.), forthco ..."
Abstract

Cited by 528 (4 self)
 Add to MetaCart
This paper provides an elementary, nontechnical, survey of auction theory, by introducing and describing some of the critical papers in the subject. (The most important of these are reproduced in a companion book, The Economic Theory of Auctions, Paul Klemperer (ed.), Edward Elgar (pub
Results 11  20
of
119,623