8728 search results - page 397 / 1746 » On Reduct Construction Algorithms |
168
click to vote
PPSN
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. The multiple sequence alignment problem (MSA) can be reformulated as the problem of finding a maximum weight trace in an alignment graph, which is derived from all pairw...
169
click to vote
FCT
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
145
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows. We begin with a complete graph on n vertices and proceed to remove the ed...
190
click to vote
MOC
1998
15 years 6 months ago
1998
Abstract. A sweep-plane algorithm of Lawrence for convex polytope computation is adapted to generate random tuples on simple polytopes. In our method an affine hyperplane is swept ...
151
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— In [1] a balanced canonical form for continuoustime lossless systems was presented. This form has a tridiagonal dynamical matrix A and the useful property that the corr...