7930 search results - page 518 / 1586 » Greedy in Approximation Algorithms |
312
click to vote
POPL
2007
ACM
16 years 7 months ago
2007
ACM
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
297
click to vote
SIGMOD
2006
ACM
16 years 7 months ago
2006
ACM
Traditional duplicate elimination techniques are not applicable to many data stream applications. In general, precisely eliminating duplicates in an unbounded data stream is not f...
195
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
156
click to vote
FOSSACS
2007
Springer
16 years 1 months ago
2007
Springer
Desharnais, Gupta, Jagadeesan and Panangaden introduced a family of behavioural pseudometrics for probabilistic transition systems. These pseudometrics are a quantitative analogue ...
192
click to vote
PAKDD
2007
ACM
16 years 1 months ago
2007
ACM
Catching the recent trend of data is an important issue when mining frequent itemsets from data streams. To prevent from storing the whole transaction data within the sliding windo...