874 search results - page 113 / 175 » Faster Algorithms for Semi-Matching Problems |
DAWAK
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Due to the dynamic nature of online information, XML documents typically evolve over time. The change of the data values or structures of an XML document may exhibit some...
139
click to vote
STOC
1997
ACM
15 years 2 months ago
1997
ACM
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
SODA
1993
ACM
14 years 11 months ago
1993
ACM
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
CPM
2007
Springer
15 years 4 months ago
2007
Springer
We present a method to speed up the dynamic program algorithms used for solving the HMM decoding and training problems for discrete time-independent HMMs. We discuss the applicatio...
SARA
2007
Springer
15 years 4 months ago
2007
Springer
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are NPhard. To overcom...