5100 search results - page 580 / 1020 » The Linear Complexity of a Graph |
161
click to vote
WIA
2001
Springer
15 years 11 months ago
2001
Springer
A vector algorithm is an algorithm that applies a bounded number of vector operations to an input vector, regardless of the length of the input. In this paper, we describe the link...
160
click to vote
ISPD
1999
ACM
15 years 11 months ago
1999
ACM
Netlist partitioning is an important and well studied problem. In this paper, a linear time partitioning approach based on iterative deletion is presented. We use the partitioning...
139
click to vote
VLSID
1997
IEEE
15 years 11 months ago
1997
IEEE
Integer addition is one of the most important operations in digital computer systems because the performance of processors is significantly influenced by the speed of their adde...
168
click to vote
CAIP
1997
Springer
15 years 11 months ago
1997
Springer
: A new hardware structure for implementation of soft morphological filters is presented in this paper. This is based on the modification of the majority gate technique. A pipeline...
210
click to vote
COCO
1993
Springer
15 years 11 months ago
1993
Springer
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...