3415 search results - page 516 / 683 » Lower bounds on kernelization |
135
click to vote
SPAA
2009
ACM
16 years 6 months ago
2009
ACM
Transactional memory (TM) is a promising approach for designing concurrent data structures, and it is essential to develop better understanding of the formal properties that can b...
151
click to vote
PKC
2009
Springer
16 years 6 months ago
2009
Springer
Network coding offers increased throughput and improved robustness to random faults in completely decentralized networks. In contrast to traditional routing schemes, however, netw...
237
click to vote
PODS
2009
ACM
16 years 6 months ago
2009
ACM
We consider the the problem of tracking heavy hitters and quantiles in the distributed streaming model. The heavy hitters and quantiles are two important statistics for characteri...
154
Voted
KDD
2004
ACM
16 years 6 months ago
2004
ACM
For the discovery of similar patterns in 1D time-series, it is very typical to perform a normalization of the data (for example a transformation so that the data follow a zero mea...
158
Voted
KDD
2002
ACM
16 years 6 months ago
2002
ACM
In this paper we investigate the general problem of discovering recurrent patterns that are embedded in categorical sequences. An important real-world problem of this nature is mo...