Sciweavers

1368 search results - page 4 / 274
» Avoiding Simplicity Is Complex
Sort
View
IJFCS
2006
70views more  IJFCS 2006»
13 years 9 months ago
The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
Sebastian Wernicke, Jochen Alber, Jens Gramm, Jion...
INFOCOM
1993
IEEE
14 years 1 months ago
Rate-Controlled Static-Priority Queueing
We propose a new service discipline, called the RateControlledStatic-Priority (RCSP) queueingdiscipline, that can provide throughput, delay, delay jitter, and loss free guarantees...
Hui Zhang, Domenico Ferrari
AISC
2000
Springer
14 years 2 months ago
Reasoning about the Elementary Functions of Complex Analysis
There are many problems with the simplification of elementary functions, particularly over the complex plane. Systems tend to make “howlers” or not to simplify enough. In thi...
Robert M. Corless, James H. Davenport, David J. Je...
CORR
2010
Springer
65views Education» more  CORR 2010»
13 years 7 months ago
A Note on Solid Coloring of Pure Simplicial Complexes
We establish a simple generalization of a known result in the plane. The simplices in any pure simplicial complex in Rd may be colored with d+1 colors so that no two simplices tha...
Joseph O'Rourke