8728 search results - page 435 / 1746 » On Reduct Construction Algorithms |
179
click to vote
SOFSEM
1997
Springer
15 years 11 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
195
click to vote
HPDC
1993
IEEE
15 years 11 months ago
1993
IEEE
Wepresent an object-oriented framework for constructing parallel implementations of stencil algorithms. This framework simplifres the development process by encapsulating the comm...
223
click to vote
RECOMB
2000
Springer
15 years 11 months ago
2000
Springer
We present a lossless compression algorithm, GenCompress, for genetic sequences, based on searching for approximate repeats. Our algorithm achieves the best compression ratios for...
189
click to vote
DAC
1995
ACM
15 years 11 months ago
1995
ACM
—Motivated by the goal of increasing the performance of FPGA-based designs, we propose new Steiner and arborescence FPGA routing algorithms. Our Steiner tree constructions signiï...
232
Voted
CCCG
2010
15 years 9 months ago
2010
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...