451 search results - page 29 / 91 » Some Lower Bounds on Geometric Separability Problems |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for boun...
TPDS
1998
14 years 9 months ago
1998
—A matrix A of size m n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 i < j m, the minimum value in row j lies below or to...
MICS
2007
14 years 9 months ago
2007
Spectra and pseudospectra of matrix polynomials are of interest in geometric intersection problems, vibration problems, and analysis of dynamical systems. In this note we consider ...
74
Voted
STOC
1992
ACM
15 years 1 months ago
1992
ACM
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
ANOR
2005
14 years 9 months ago
2005
: We consider in this paper a two-machine flowshop scheduling problem in which the first machine processes jobs individually while the second machine processes jobs in batches. The...