2981 search results - page 331 / 597 » Word Sense and Subjectivity |
185
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...
182
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
163
Voted
SIAMCOMP
1998
15 years 6 months ago
1998
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
165
click to vote
SIAMDM
1998
15 years 6 months ago
1998
In this paper we present and describe an improved version of the Zero-Neighbors algorithm, which we call the Zero-Coverings algorithm. We also present a method for finding a small...
134
click to vote
SIAMAM
2002
15 years 6 months ago
2002
A simple single substrate limiting model of a growing biofilm layer is presented. One-dimensional moving front solutions are analyzed. Under certain conditions these solutions are ...