4463 search results - page 390 / 893 » computing 2000 |
136
click to vote
SODA
2000
ACM
15 years 8 months ago
2000
ACM
Real Scaled Matching is the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary real-sized scale, appears. Real scale...
166
Voted
SODA
2000
ACM
15 years 8 months ago
2000
ACM
We discuss the problem of optimally "finishing" a partially sequenced, reconstructed DNA segment. At first sight, this appears to be computationally hard. We construct a...
203
click to vote
SODA
2000
ACM
15 years 8 months ago
2000
ACM
A strategy is presented to find a set of points which yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear Complex (PLC). This algorithm is nove...
170
click to vote
SODA
2000
ACM
15 years 8 months ago
2000
ACM
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
196
click to vote
UAI
2000
15 years 8 months ago
2000
Qualitative probabilistic networks have been designed for probabilistic reasoning in a qualitative way. Due to their coarse level of representation detail, qualitative probabilist...