An Extensible and Personalized Approach to QoS-enabled Semantic Web Service Discovery
Related publications (24)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Sensing devices are increasingly being deployed to monitor the physical world around us. One class of application for which sensor data is pertinent is environmental decision support systems, e.g., flood emergency response. For these applications, the sens ...
In this paper we present a novel method to obtain the basic frequency of an unknown periodic signal with an arbitrary waveform, which can work online with no additional signal processing or logical operations. The method originates from non-linear dynamica ...
The efficient synthesis of circuits is a well-studied problem. Due to the NP-hardness of the problem, no optimal algorithm has been presented so far. However, the heuristics presented by several researchers in the past, which are also adopted by commercial ...
We present an extensible and customizable framework for the autonomous discovery of Semantic Web services based on their QoS properties. Using semantic technologies, users can specify the QoS matching model and customize the ranking of services flexibly ac ...
Effective opportunistic search in visual interfaces for large information collections, such as documents, Web pages, and annotated images, often requires domain knowledge that the information seeker does not have. Relevant semantic information, such as met ...
This paper introduces the connection-graph-stability method and uses it to establish a new lower bound on the algebraic connectivity of graphs (the second smallest eigenvalue of the Laplacian matrix of the graph) that is sharper than the previously publish ...
Modern experimental techniques for the quantitative, time-course measurement of protein concentrations and gene activation levels enable the identification of dynamical models of genetic regulatory networks. In general, identification involves fitting appr ...
Effectively managing a large collection of multimedia documents is a challenge, addressed by many disciplines from signal processing through database systems to artificial intelligence and interaction design. The problems to be solved have rarely been cons ...
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints with a rich set of operations. A key challenge is to define such classes of ...
Personalization in e-commerce has so far been server-centric, requiring users to create a separate individual profile on each server that they like to access. As product information is increasingly coming from multiple and heterogeneous sources, the number ...