101 search results - page 15 / 21 » Experimental study of protocol-independent redundancy elimin... |
WWW
2004
ACM
14 years 10 months ago
2004
ACM
Studying Web graphs is often difficult due to their large size. Recently, several proposals have been published about various techniques that allow to store a Web graph in memory ...
SSD
2005
Springer
14 years 3 months ago
2005
Springer
A moving cluster is defined by a set of objects that move close to each other for a long time interval. Real-life examples are a group of migrating animals, a convoy of cars movin...
ICCBR
2003
Springer
14 years 3 months ago
2003
Springer
CBR applications running in real domains can easily reach thousands of cases, which are stored in the case library. Retrieval times can increase greatly if the retrieval algorithm ...
EDBT
2011
ACM
13 years 1 months ago
2011
ACM
Continuous top-k queries, which report a certain number (k) of top preferred objects from data streams, are important for a broad class of real-time applications, ranging from fi...
CIKM
2011
Springer
12 years 9 months ago
2011
Springer
A continuous top-k query retrieves the k most preferred objects in a data stream according to a given preference function. These queries are important for a broad spectrum of appl...