2930 search results - page 234 / 586 » The optimal sequence compression |
143
click to vote
CRV
2009
IEEE
16 years 15 days ago
2009
IEEE
The problem of online sampling of data, can be seen as a generalization of the classical secretary problem. The goal is to maximize the probability of picking the k highest scorin...
147
click to vote
ESA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We show that optimal alphabetic binary trees can be constructed in O(n) time if the elements of the initial sequence are drawn from a domain that can be sorted in linear ...
136
click to vote
ISCAS
2003
IEEE
15 years 11 months ago
2003
IEEE
Since Limís 1986 paper on the frequency-response masking (FRM) technique for the design of FIR digital Ýlters with very small transition widths, the analysis and design of FRM ...
144
click to vote
SIGMETRICS
2010
ACM
15 years 10 months ago
2010
ACM
We propose a new approach to optimize the deployment and the sampling rates of network monitoring tools, such as Netflow, on a large IP network. It reduces to solving a stochasti...
156
click to vote
ACL
1998
15 years 7 months ago
1998
There exist several methods of calculating a similarity curve, or a sequence of similarity values, representing the lexical cohesion of successive text constituents, e.g., paragra...