Now showing items 723-742 of 1009

  • Quality enhancement of quality-asymmetric multiview plus depth video by using virtual view 

    Jin Z; Tillo T; Luo L (IEEE, 2015)
    Currently, multiview video plus depth format is one of the most popular 3D data representations which enables to generate any required intermediate view in a certain range. However, in terms of encoding and decoding ...
  • Quantifiers in XQuery 

    May, N; Helmer, S; Moerkotte, G (IEEE Computer Society, 2003)
    We present algebraic equivalences that allow to unnest nested algebraic expressions containing quantifiers for order-preserving algebraic operators. We illustrate how these equivalences can be applied successfully to unnest ...
  • Query Answering in Ontologies under Preference Rankings 

    Ceylan I; Lukasiewicz T; Peñaloza R; Tifrea-Marciuska O (International Joint Conferences on Artificial Intelligence, 2017)
    We present an ontological framework, based on preference rankings, that allows users to express their preferences between the knowledge explicitly available in the ontology. Using this formalism, the answers for a given ...
  • Query Answering over Description Logic Ontologies 

    Calvanese D (Springer, 2014)
    Description Logics (DLs) provide the formal foundation for ontology languages, and they have been advocated as formalisms for modeling the domain of interest in various settings, including the Semantic Web, data and ...
  • Query Quality Prediction and Reformulation for Source Code Search: The Refoqus Tool 

    Haiduc S; De Rosa G; Bavota G; Oliveto R; De Lucia A; Marcus A (IEEE, 2013)
    Developers search source code frequently during their daily tasks, to find pieces of code to reuse, to find where to implement changes, etc. Code search based on text retrieval (TR) techniques has been widely used in the ...
  • Query rewriting in DL-Lite HN horn 

    Botoeva, E; Artale, A; Calvanese, D (CEUR-WS.org, 2010)
    In this paper we present practical algorithms for query answering and knowledge base satisfiability checking in DL-Lite (HN) horn, a logic from the extended DL-Lite family that contains horn concept inclusions and number ...
  • Query Stability in Monotonic Data-Aware Business Processes 

    Savkovic, O; Marengo, E; Nutt, W (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2016)
    Organizations continuously accumulate data, often according to some business processes. If one poses a query over such data for decision support, it is important to know whether the query is stable, that is, whether the ...
  • Query-Based Entailment and Inseparability for ALC Ontologies 

    Botoeva E; Lutz C; Ryzhikov V; Wolter F; Zakharyaschev M (AAAI Press, 2016)
    We investigate the problem whether two ALC knowledge bases are indistinguishable by queries over a given vocabulary. We give model-theoretic criteria and prove that this problem is undecidable for conjunctive queries (CQs) ...
  • Quest, an OWL 2 QL reasoner for ontology-based data access 

    Rodriguez-Muro M; Calvanese D (CEUR-WS.org, 2012)
    Abstract. Ontology Based Data Access (OBDA) has drawn considerable attention from the OWL and RDF communities. In OBDA, instance data is accessed by means of mappings, which state the relationship between the data in a ...
  • Quest: Efficient SPARQL-to-SQL for RDF and OWL 

    Rodriguez-Muro M; Hardi J; Calvanese D (CEUR-WS.org, 2012)
  • Rails Girls 54: Making Rails Girls Even More Fun 

    Abrahamsson P; Helmer S; Stan A (University of Lübeck, 2016)
    Rails Girls, which originated in Finland, is a workshop for young women and girls to learn web application development from scratch using Ruby on Rails, i.e., no prior knowledge in programming is required. Here, we want ...
  • Ranking of evolving stories through meta-aggregation 

    Gordevicius, J; Estrada, F; Lee, HC; Andritsos, P; Gamper, J (ACM, 2010)
    In this paper we focus on the problem of ranking news stories within their historical context by exploiting their content similarity. We observe that news stories evolve and thus have to be ranked in a time and query ...
  • Rate of convergence for a Galerkin scheme approximating a two-scale reaction-diffusion system with nonlinear transmission condition 

    Muntean A; Lakkis O (RIMS, 2010)
    We study a two-scale reaction-diffusion system with nonlinear reaction terms and a nonlinear transmission condition (remotely ressembling Henry's law) posed at air-liquid interfaces. We prove the rate of convergence of the ...
  • Rating Elicitation Strategies for Collaborative Filtering 

    Elahi M; Repsys V; Ricci F (Springer, 2011)
    The accuracy of collaborative filtering recommender systems largely depends on two factors: the quality of the recommendation algorithm and the nature of the available item ratings. In general, the more ratings are elicited ...
  • Real-time forward error correction for video transmission 

    Xiao J; Tillo T; Lin C; Zhao Y (IEEE, 2011)
    When the video streams are transmitted over the unreliable networks, forward error correction (FEC) codes are usually used to protect them. Reed-Solomon codes are block-based FEC codes. On one hand, enlarging the block ...
  • Real-time macroblock level bits allocation for depth maps in 3-D video coding 

    Xiao J; Tillo T; Yuan H (Springer, 2012)
    In the texture-plus-depth 3-D video format, the texture videos and depth maps will affect the quality of the synthesized views, this makes bits allocation for the depth maps indispensable. The existing bits allocation ...
  • Real-time video streaming exploiting the late-arrival packets 

    Xiao J; Tillo T; Lin C; Zhao Y (IEEE, 2012)
    For real-time video applications, such as video telephony service, the allowed maximum end-to-end transmission delay is usually fixed. The packets arriving at the destination out of the maximum end-to-end delay are treated ...
  • Reasoning about Relation Based Access Control 

    Artale, A; Crispo, B; Giunchiglia, F; Turkmen, F; Zhang, R (IEEE Computer Society, 2010)
    Relation Based Access Control (RelBAC) is an access control model that places permissions as first class concepts. Under this model, we discuss in this paper how to formalize typical access control policies with Description ...
  • Reasoning in Expressive Description Logics under Infinitely Valued Gödel Semantics 

    Borgwardt, S; Penaloza, R (Springer, 2015)
    Fuzzy Description Logics (FDLs) combine classical Description Logics with the semantics of Fuzzy Logics in order to represent and reason with vague knowledge. Most FDLs using truth values from the interval [0,1] have been ...
  • Reasoning in Expressive Gödel Description Logics 

    Borgwardt S; Peñaloza R (CEUR, 2016)
    Fuzzy description logics (FDLs) are knowledge representation formalisms capable of dealing with imprecise knowledge by allowing intermediate membership degrees in the interpretation of concepts and roles. One option for ...