2957 search results - page 374 / 592 » The Complexity of Polynomial-Time Approximation |
161
click to vote
RECOMB
2003
Springer
16 years 6 months ago
2003
Springer
Many genomic sequences and, more generally, (multivariate) time series display tremendous variability. However, often it is reasonable to assume that the sequence is actually gene...
173
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
277
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
Complex queries over high speed data streams often need to rely on approximations to keep up with their input. The research community has developed a rich literature on approximat...
176
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Latent Semantic Indexing (LSI) has been validated to be effective on many small scale text collections. However, little evidence has shown its effectiveness on unsampled large sca...
143
click to vote
ICCAD
2002
IEEE
16 years 3 months ago
2002
IEEE
- The new concept of Multi-node Moment Matching (MMM) is introduced in this paper. The MMM technique simultaneously matches the moments at several nodes of a circuit using explicit...