Now showing items 311-330 of 1012

  • Exploiting Hierarchies for Efficient Detection of Completeness in Stream Data 

    Razniewski S; Sadiq SW; Zhou X (ADC, 2016)
    In big data settings, the data can often be externally sourced with little or no knowledge of its quality. In such settings, users need to be empowered with the capacity to understand the quality of data sets and implications ...
  • Exploiting implicit affective labeling for image recommendations 

    Tkalčič M; Odić A; Košir A; Tasič J (IEEE, 2012)
    Recent work has shown an increase of accuracy in recommender systems that use affective labels. In this paper we compare three labeling methods within a recommender system for images: (i) generic labeling, (ii) explicit ...
  • Exploiting multiple action types in recommender systems 

    Gurbanov T; Ricci F (CEUR-WS.org, 2017)
    Implicit feedback recommender systems provide personalized suggestions for items that are predicted to be of interest to the user, by collecting online users' activity and inferring from it users' preferences. While the ...
  • Exploring Graph Partitioning for Shortest Path Queries on Road Networks 

    Chondrogiannis T; Gamper J (Gesellschaft für Informatik e.V., 2014)
    Computing the shortest path between two locations in a road network is an important  problem that has found numerous applications. The classic solution for the problem is Dijkstra’s algorithm. Although simple and elegant, ...
  • Exploring How Feature Usage Relates to Customer Perceived Value: A Case Study in a Startup Company 

    Marciuska, S; Gencel, C; Abrahamsson, P (Springer, 2013)
    Most of the business value of a software product comes from only a small proportion of its features. Product managers face the challenge of identifying the high value features in an application and weeding out the ones of ...
  • Exploring the Convertibility between IFPUG and COSMIC Function Points: Preliminary Findings 

    Gencel, C; Bideau, C (CPS, 2012)
    This paper presents the initial findings of an exploratory case study on the convertibility between IFPUG and COSMIC Function Points (FP). Even though a number of conversion approaches have been proposed in the literature, ...
  • Exploring the semantic gap for movie recommendations 

    Elahi M; Yashar D; Bakhshandegan Moghaddam F; Cella L; Cereda S; Cremonesi P (ACM, 2017)
    In the last years, there has been much attention given to the semantic gap problem in multimedia retrieval systems. Much effort has been devoted to bridge this gap by building tools for the extraction of high-level, ...
  • Exploring Users' Perception of Collaborative Explanation Styles 

    Coba L; Zanker M; Rook L; Symeonidis P (IEEE, 2018)
    Collaborative filtering systems heavily depend on user feedback expressed in product ratings to select and rank items to recommend. In this study we explore how users value different collaborative explanation styles following ...
  • Exploring Users' Perception of Rating Summary Statistics 

    Coba L; Symeonidis P; Zanker M (ACM, 2018)
    Collaborative filtering systems heavily depend on user feedback expressed in product ratings to select and rank items to recommend. These summary statistics of rating values carry two important descriptors about the assessed ...
  • Expressing and verifying business contracts with abductive logic programming 

    Alberti M; Chesani F; Gavanelli M; Lamma E; Mello P; Montali M; Torroni P (IBFI, 2007)
    In this article, we propose to adopt the SCIFF abductive logic language to specify business contracts, and show how its proof procedures are useful to verify contract execution and fulfilment. SCIFF is a declarative language ...
  • Expressing DL-Lite ontologies with Controlled English 

    Bernardi, R; Calvanese, D; Thorne, C (Bozen-Bolzano University Press, 2007)
    In this paper we deal with the problem of providing natural language front-ends to databases upon which an ontology layer has been added. Specifically, we are interested in expressing ontologies formalized in Description ...
  • Expressing No-Value Information in RDF 

    Darari, F; Prasojo, RE; Nutt, W (CEUR Workshop Proceedings, 2015)
    RDF is a data model to represent positive information. Consequently, it is not clear how to represent the non-existence of information in RDF. We present a technique to express such information in RDF and incorporate it ...
  • Expressive approximations in DL-Lite ontologies 

    Botoeva E; Calvanese D; Rodriguez-Muro M (Springer, 2010)
    Ontology based data access (OBDA) is concerned with providing access to typically very large data sources through a mediating conceptual layer that allows one to improve answers to user queries by taking into account domain ...
  • Expressivity and Complexity of MongoDB Queries 

    Botoeva E; Calvanese D; Cogrel B; Xiao G (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018)
    In this paper, we consider MongoDB, a widely adopted but not formally understood database system managing JSON documents and equipped with a powerful query mechanism, called the aggregation framework. We provide a clean ...
  • Extending DL-LiteA with (Singleton) Nominals 

    Haddad MG; Calvanese D (CEUR Electronic Workshop Proceedings, 2013)
    In this paper we study the extension of description logics of the extit{DL-Lite} family with singleton nominals, which correspond in OWL~2 to the ObjectHasValue construct. Differently from arbitrary (non-singleton) nominals, ...
  • Extending DLR with labelled tuples, projections, functional dependencies and objectification 

    Artale A; Franconi E (CEUR-WS.org, 2016)
    We introduce an extension of the n-ary description logic DLR to deal with attribute-labelled tuples (generalising the positional notation), with arbitrary projections of relations (inclusion dependencies), generic functional ...
  • Extensions during software evolution: Do objects meet their promise? 

    Robbes R; Röthlisberger D; Tanter E (Springer, 2012)
    As software evolves, data types have to be extended, possibly with new data variants or new operations. Object-oriented design is well-known to support data extensions well. In fact, most popular books showcase data ...
  • An extensive comparison of bug prediction approaches 

    D'Ambros M; Lanza M; Robbes R (IEEE Computer Society, 2010)
    Reliably predicting software defects is one of software engineering's holy grails. Researchers have devised and implemented a plethora of bug prediction approaches varying in terms of accuracy, complexity and the input ...
  • Extrapolation-accelerated Aggregation Multigrid with Block Relaxations for GeneRank Problems 

    Shen ZL; Huang TZ; Wen C; Zhang HF; Carpentieri B (ACM, 2017)
    This paper proposes an aggregation multigrid method for computing the GeneRank problem. In this multigrid, the GeneRank transition matrix's formulation is well exploited, and a Block-Jacobi relaxation based on the aggregates, ...
  • eXtreme apprenticeship e learning by doing: Sperimentazione di nuovi metodi nella didattica delle Basi di Dati 

    Dodero, G; Lena, R; Del Fatto, V (AICA, 2015)
    Il contributo presenta un metodo innovativo di insegnamento delle Basi di Dati e i risultati della sperimentazione in un Istituto Tecnico. Tale metodo è basato sulla metodologia “Extreme Apprenticeship”, congiunta ad ...