5100 search results - page 543 / 1020 » The Linear Complexity of a Graph |
145
click to vote
MFCS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We consider the iterates of bilinear functions over the semiring (max, +). Equivalently, our object of study can be viewed as recognizable tree series over the semiring (...
184
click to vote
POS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. This paper presents the performance evaluation of five memory allocation strategies for the PerDiS Persistent Distributed Object store in the context of allocating two di...
167
Voted
IPPS
1995
IEEE
15 years 10 months ago
1995
IEEE
The linear systems associated with large, sparse, symmetric, positive definite matrices are often solved iteratively using the preconditioned conjugate gradient method. We have d...
184
Voted
STOC
1995
ACM
15 years 10 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
211
Voted
ICCI
1991
15 years 10 months ago
1991
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...