9842 search results - page 1857 / 1969 » The Complexity of the Matching-Cut Problem |
INFOVIS
2000
IEEE
14 years 2 months ago
2000
IEEE
Data visualization environments help users understand and analyze their data by permitting interactive browsing of graphical representations of the data. To further facilitate und...
IPPS
2000
IEEE
14 years 2 months ago
2000
IEEE
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O N , where 2 3. We show that such an algorithm can be parallelize...
IPPS
2000
IEEE
14 years 2 months ago
2000
IEEE
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
MICRO
2000
IEEE
14 years 2 months ago
2000
IEEE
The design and implementation of a modern microprocessor creates many reliability challenges. Designers must verify the correctness of large complex systems and construct implemen...
SSIAI
2000
IEEE
14 years 2 months ago
2000
IEEE
The use of random fields, which allows one to take into account the spatial interaction among random variables in complex systems, is a frequent tool in numerous problems of stati...