Sciweavers

1346 search results - page 5 / 270
» On the number of rectangular partitions
Sort
View
DSD
2002
IEEE
97views Hardware» more  DSD 2002»
13 years 11 months ago
Recursive Bi-Partitioning of Netlists for Large Number of Partitions
Rolf Drechsler, Wolfgang Günther, Thomas Esch...
SODA
2003
ACM
127views Algorithms» more  SODA 2003»
13 years 8 months ago
Binary space partitions for 3D subdivisions
We consider the following question: Given a subdivision of space into n convex polyhedral cells, what is the worst-case complexity of a binary space partition (BSP) for the subdiv...
John Hershberger, Subhash Suri
SIAMMAX
2010
84views more  SIAMMAX 2010»
13 years 1 months ago
Smoothed Analysis of Moore-Penrose Inversion
Abstract. We perform a smoothed analysis of the condition number of rectangular matrices. We prove that, asymptotically, the expected value of this condition number depends only of...
Peter Bürgisser, Felipe Cucker
SIU
2002
97views more  SIU 2002»
13 years 6 months ago
Problem Generators for Rectangular packing problems
Abstract. In order to verify and test the performance of new packing algorithms relative to existing algorithms, test problems are needed. The scope of published test instances for...
E. Hopper, B. C. H. Turton
ANOR
2010
153views more  ANOR 2010»
13 years 4 months ago
Solving the Rectangular assignment problem and applications
The rectangular assignment problem is a generalization of the linear assignment problem (LAP): one wants to assign a number of persons to a smaller number of jobs, minimizing the ...
J. Bijsterbosch, A. Volgenant