Publications de Kresimir Pripuzic

Time- and Space-Efficient Sliding Window Top-k Query Processing

A sliding window top-k (top-k/w) query monitors incoming data stream objects within a sliding window of size w to identify the k highest-ranked objects with respect to a given scoring function over time. Processing of such queries is challenging because, e ...

Association for Computing Machinery2015

Top-k/w publish/subscribe: A publish/subscribe model for continuous top-k processing over data streams

Karl Aberer, Kresimir Pripuzic

Continuous processing of top-k queries over data streams is a promising technique for alleviating the information overload problem as it distinguishes relevant from irrelevant data stream objects with respect to a given scoring function over time. Thus it ...

Pergamon-Elsevier Science Ltd2014

Top-k/w publish/subscribe: A publish/subscribe model for continuous top-k processing over data streams

Karl Aberer, Ivana Podnar, Kresimir Pripuzic

Wiley-Blackwell2014

Distributed processing of continuous sliding-window k-NN queries for data stream filtering

Karl Aberer, Ivana Podnar, Kresimir Pripuzic

A sliding-window k-NN query (k-NN/w query) continuously monitors incoming data stream objects within a sliding window to identify k closest objects to a query. It enables effective filtering of data objects streaming in at high rates from potentially distr ...

Springer Verlag2011

Top-k/w publish/subscribe: finding k most relevant publications in sliding time window w

Karl Aberer, Ivana Podnar, Kresimir Pripuzic

Existing content-based publish/subscribe systems are designed assuming that all matching publications are equally relevant to a subscription. As we cannot know in advance the distribution of publication content, the following two unwanted situations are hi ...

ACM2008

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Kresimir Pripuzic

Graph Chatbot

Chattez avec Graph Search