4378 search results - page 740 / 876 » On the Complexity of Ordered Colourings |
199
click to vote
SIGECOM
2003
ACM
15 years 11 months ago
2003
ACM
Some recent trends in business and manufacturing hold the promise of greater profits, yet, due to profit-robbing inventory increases, this promise has not been fully realized. [9]...
178
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
234
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
165
click to vote
CW
2002
IEEE
15 years 11 months ago
2002
IEEE
For sparse array operations, in general, the sparse arrays are compressed by some data compression schemes in order to obtain better performance. The Compressed Row/Column Storage...
140
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— The nullspace method is a powerful framework to solve the synthesis problem of fault detection filters in the most general setting. It is also well suited to address the least...