Search For:

Displaying 1-21 out of 21 total
Continuous query evaluation over distributed sensor networks
Found in: Data Engineering, International Conference on
By Oana Jurca, Sebastian Michel, Alexandre Herrmann, Karl Aberer
Issue Date:March 2010
pp. 912-923
In this paper<sup>1</sup> we address the problem of processing continuous multi-join queries, over distributed data streams. Our approach makes use of existing work in the field of publish/subscribe systems. We show how these principles can be ...
 
Knowing When to Slide - Efficient Scheduling for Sliding Window Processing
Found in: Mobile Data Management, IEEE International Conference on
By Ali Salehi, Mehdi Riahi, Sebastian Michel, Karl Aberer
Issue Date:May 2009
pp. 202-211
We consider sliding window query execution scheduling in stream processing engines. Sliding windows are an essential building block to limit the query focus at a particular part of the stream, based either on value count or time ranges. These so called sli...
 
Environmental Monitoring 2.0
Found in: Data Engineering, International Conference on
By Sebastian Michel, Ali Salehi, Liqian Luo, Nicholas Dawes, Karl Aberer, Guillermo Barrenetxea, Mathias Bavay, Aman Kansal, K. Ashwin Kumar, Suman Nath, Marc Parlange, Stewart Tansley, Catharine van Ingen, Feng Zhao, Yongluan Zhou
Issue Date:April 2009
pp. 1507-1510
A sensor network data gathering and visualization infrastructure is demonstrated, comprising of Global Sensor Networks (GSN) middleware and Microsoft SensorMap. Users are invited to actively participate in the process of monitoring real-world deployments a...
 
Sensor Metadata Management and Its Application in Collaborative Environmental Research
Found in: eScience, IEEE International Conference on
By Nicholas Dawes, K. Ashwin Kumar, Sebastian Michel, Karl Aberer, Michael Lehning
Issue Date:December 2008
pp. 143-150
This paper considers metadata generation and tracking in a collaborative environment where users publish raw sensor data in the form of virtual sensors and post-process data by means of filtering, modeling, or query processing techniques. In the metadata s...
 
P2P Directories for Distributed Web Search: From Each According to His Ability, to Each According to His Needs
Found in: Data Engineering Workshops, 22nd International Conference on
By Matthias Bender, Sebastian Michel, Gerhard Weikum
Issue Date:April 2006
pp. 51
A compelling application of peer-to-peer (P2P) system technology would be distributed Web search, where each peer autonomously runs a search engine on a personalized local corpus (e.g., built from a thematically focused Web crawl) and peers collaborate by ...
 
Automated educated guessing
Found in: 2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW)
By Aleksandar Stupar,Sebastian Michel
Issue Date:April 2013
pp. 19-20
We describe the vision of a system that performs “educated guessing” to answer ad hoc information needs in case of missing or undisclosed information. The guessing procedure is based on discovered common patterns, obtained from structured and semi-structur...
   
The essence of knowledge (bases) through entity rankings
Found in: Proceedings of the 22nd ACM international conference on Conference on information & knowledge management (CIKM '13)
By Evica Ilieva, Sebastian Michel, Aleksandar Stupar
Issue Date:October 2013
pp. 1537-1540
We consider the task of automatically phrasing and computing top-k rankings over the information contained in common knowledge bases (KBs), such as YAGO or DBPedia. We assemble the thematic focus and ranking criteria of rankings by inspecting the present S...
     
SRbench--a benchmark for soundtrack recommendation systems
Found in: Proceedings of the 22nd ACM international conference on Conference on information & knowledge management (CIKM '13)
By Aleksandar Stupar, Sebastian Michel
Issue Date:October 2013
pp. 2285-2290
In this work, a benchmark to evaluate the retrieval performance of soundtrack recommendation systems is proposed. Such systems aim at finding songs that are played as background music for a given set of images. The proposed benchmark is based on preference...
     
A thin monitoring layer for top-k aggregation queries over a database
Found in: Proceedings of the 7th International Workshop on Ranking in Databases (DBRank '13)
By Foteini Alvanaki, Sebastian Michel
Issue Date:August 2013
pp. 1-6
We consider the problem of maintaining a large set of top-k rankings over the update stream of a database. The rankings stem from top-k aggregation queries that are given a-priori based on the application scenario, for instance created along dimensions of ...
     
Being picky: processing top-k queries with set-defined selections
Found in: Proceedings of the 21st ACM international conference on Information and knowledge management (CIKM '12)
By Aleksandar Stupar, Sebastian Michel
Issue Date:October 2012
pp. 912-921
Focusing on the top-K items according to a ranking criterion constitutes an important functionality in many different query answering scenarios. The idea is to read only the necessary information---mostly from secondary storage---with the ultimate goal to ...
     
PICASSO: automated soundtrack suggestion for multi-modal data
Found in: Proceedings of the 20th ACM international conference on Information and knowledge management (CIKM '11)
By Aleksandar Stupar, Sebastian Michel
Issue Date:October 2011
pp. 2589-2592
We demonstrate PICASSO, a novel approach to soundtrack recommendation. Given text, video, or image documents, PICASSO selects the best fitting music pieces, out of a given set of files, for instance, a user's personal mp3 collection. This task, commonly re...
     
Picasso - to sing, you must close your eyes and draw
Found in: Proceedings of the 34th international ACM SIGIR conference on Research and development in Information (SIGIR '11)
By Aleksandar Stupar, Sebastian Michel
Issue Date:July 2011
pp. 715-724
We study the problem of automatically assigning appropriate music pieces to a picture or, in general, series of pictures. This task, commonly referred to as soundtrack suggestion, is non-trivial as it requires a lot of human attention and a good deal of ex...
     
The gist of everything new: personalized top-k processing over web 2.0 streams
Found in: Proceedings of the 19th ACM international conference on Information and knowledge management (CIKM '10)
By Karl Aberer, Parisa Haghani, Sebastian Michel
Issue Date:October 2010
pp. 489-498
Web 2.0 portals have made content generation easier than ever with millions of users contributing news stories in form of posts in weblogs or short textual snippets as in Twitter. Efficient and effective filtering solutions are key to allow users stay tune...
     
Evaluating top-k queries over incomplete data streams
Found in: Proceeding of the 18th ACM conference on Information and knowledge management (CIKM '09)
By Karl Aberer, Parisa Haghani, Sebastian Michel
Issue Date:November 2009
pp. 877-886
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addressed research topic in recent years. Most approaches, however, assume synchron...
     
Processing publish/subscribe queries over distributed data streams
Found in: Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (DEBS '09)
By Alexandre Herrmann, Karl Aberer, Oana Jurca, Sebastian Michel
Issue Date:July 2009
pp. 1-4
We address the problem of processing continuous multi-join queries, over distributed data streams, making use of existing work in the field of publish/subscribe systems. We show how these principles can be ported to data streams, by enriching the common qu...
     
Rethinking email message and people search
Found in: Proceedings of the 18th international conference on World wide web (WWW '09)
By Ingmar Weber, Sebastian Michel
Issue Date:April 2009
pp. 66-66
We show how a number of novel email search features can be implemented without any kind of natural language processing (NLP) or advanced data mining. Our approach inspects the email headers of all messages a user has ever sent or received and it creates si...
     
Distributed similarity search in high dimensions using locality sensitive hashing
Found in: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (EDBT '09)
By Karl Aberer, Parisa Haghani, Sebastian Michel
Issue Date:March 2009
pp. 94-104
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH) which has proven very efficient in answering KNN queries in centralized set...
     
From Web 1.0 to Web 2.0 and back -: how did your grandma use to tag?
Found in: Proceeding of the 10th ACM workshop on Web information and data management (WIDM '08)
By Adriana Budura, Gleb Skobeltsyn, John G. Breslin, Karl Aberer, Sebastian Michel, Sheila Kinsella
Issue Date:October 2008
pp. 1-2
We consider the applicability of terms extracted from anchortext as a source of Web page descriptions in the form of tags. With a relatively simple and easy-to-use method, we show that anchortext significantly overlaps with tags obtained from the popular t...
     
Social recommendations at work
Found in: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (SIGIR '08)
By Gerhard Weikum, Josiane X. Parreira, Mouna Kacimi, Ralf Schenkel, Sebastian Michel, Thomas Neumann, Tom Crecelius
Issue Date:July 2008
pp. 2-2
Online communities have become popular for publishing and searching content, and also for connecting to other users. User-generated content includes, for example, personal blogs, bookmarks, and digital photos. Items can be annotated and rated by different ...
     
To tag or not to tag -: harvesting adjacent metadata in large-scale tagging systems
Found in: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (SIGIR '08)
By Adriana Budura, Karl Aberer, Philippe Cudre-Mauroux, Sebastian Michel
Issue Date:July 2008
pp. 2-2
We present HAMLET, a suite of principles, scoring models and algorithms to automatically propagate metadata along edges in a document neighborhood. As a showcase scenario we consider tag prediction in community-based Web 2.0 tagging applications. Experimen...
     
Efficient top-k querying over social-tagging networks
Found in: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (SIGIR '08)
By Gerhard Weikum, Josiane X. Parreira, Mouna Kacimi, Ralf Schenkel, Sebastian Michel, Thomas Neumann, Tom Crecelius
Issue Date:July 2008
pp. 2-2
Online communities have become popular for publishing and searching content, as well as for finding and connecting to other users. User-generated content includes, for example, personal blogs, bookmarks, and digital photos. These items can be annotated and...
     
 1