Now showing items 5715-5734 of 7342

  • 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 Monitoring of Occupants’ Thermal Comfort through Infrared Imaging: A Preliminary Study 

    Pavlin B; Pernigotto G; Cappelletti F; Bison P; Vidoni R; Gasparella A (2017)
    Thermally comfortable indoor environments are of great importance, as modern lifestyles often require people to spend more than 20 h per day indoors. Since most of the thermal comfort models use a variety of different ...
  • 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 ...
  • Real-Time Video Streaming Using Randomized Expanding Reed-Solomon Code 

    Xiao JM; Tillo T; Zhao Y (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2013)
    Forward error correction (FEC) codes are widely studied to protect streamed video over unreliable networks. Typically, enlarging the FEC coding block size can improve the error correction performance. For video streaming ...
  • Realtà narrate = Narrating reality = Wirklichkeit erzählen 

    Höger, H (2010)
    L'articolo analizza il rapporto tra la progettazione del mondo artificiale e i relativi stimoli verso percezione ed esperienza delle situazioni che ci circondano. In questo contesto, l'utente diventa quasi sempre co-autore ...
  • 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 and Query Answering with Complete Data and Ontologies 

    Ngo, Thi Phuong Nhung (Free University of Bozen-Bolzano, 2017)
    Combining relational databases and ontologies is necessary for modern query answering systems. To deal with the problem, the ontology-based data access approach uses ontologies to capture databases, i.e. databases are ...
  • Reasoning in Event-Based Distributed Systems 

    Helmer S; Poulovassilis A; Xhafa F (Springer, 2011)
    With the rapid expansion of the Internet over the last 20 years, event-based distributed systems are playing an increasingly important role in a broad range of application domains, including enterprise management, environmental ...
  • 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 ...
  • Reasoning in fuzzy description logics using automata 

    Borgwardt, S; Penaloza, R (Elsevier, 2015)
    Automata-based methods have been successfully employed to prove tight complexity bounds for reasoning in many classical logics, and in particular in Description Logics (DLs). Very recently, the ideas behind these automata-based ...
  • Reasoning in the Description Logic BEL using Bayesian Networks 

    Ceylan II; Peñaloza R (AAAI Press, 2014)
    We study the problem of reasoning in the probabilistic Description Logic ℬℲ. Using a novel structure, we show that probabilistic reasoning in this logic can be reduced in polynomial time to standard inferences over a ...
  • Reasoning on Incomplete Execution Traces Using Action Languages - A First Report 

    Francescomarino, CD; Ghidini, C; Tessaris, S; Sandoval, IV (Springer, 2015)
    In this paper we tackle the problem of reconstructing information about incomplete business process execution traces proposing an approach based on action languages.
  • Reasoning on LTL on Finite Traces: Insensitivity to Infiniteness 

    De Giacomo G; De Masellis R; Montali M (AAAI Press, 2014)
    In this paper we study when an LTL formula on finite traces (LTL/ formula) is insensitive to infiniteness, that is, it can be correctly handled as a formula on infinite traces under the assumption that at a certain point ...
  • Reasoning on temporal class diagrams: Undecidability results 

    Artale, A (Springer Verlag (Germany), 2006)
    This paper introduces a temporal class diagram language useful to model temporal varying data. The atemporal portion of the language contains the core constructors available in both EER diagrams and UML class diagrams. The ...
  • Reasoning over Evolving Graph-structured Data Under Constraints 

    Calvanese D (CEUR Electronic Workshop Proceedings, 2016)
    Graph-structured data are receiving increased attention in the database community. We argue that Description Logics (DLs), which are studied extensively in Knowledge Representation, are tightly connected to graph-structured ...
  • Reasoning over Extended ER Models 

    Artale, A; Calvanese, D; Kontchakov, R; Ryzhikov, V; Zakharyaschev, M (Springer, 2007)
    We investigate the computational complexity of reasoning over various fragments of the Extended Entity-Relationship (EER) language, which includes a number of constructs: isa between entities and relationships, disjointness ...
  • Reasoning With Weighted Ontologies 

    Peñaloza R (CEUR, 2009)
    We study the problem of reasoning over weighted ontologies. We assume that every axiom is labeled with an element of a distributive lattice (called its weight) and try to compute its so-called boundary, with respect to a ...
  • Reasoning-based Curriculum Sequencing and Validation: Integration in a Service-Oriented Architecture 

    Baldoni, M; Barogli, C; Brunkhorst, I; Marengo, E; Patti, V (Springer, 2007)
    We present a service-oriented personalization system, set in an educational framework, based on a semantic annotation of courses including prerequisites and learning objectives. The system supports users in planning ...
  • Reasons for refusal of admission to intensive care and impact on mortality 

    Iapichino G; Corbella D; Minelli C; Mills GH; Artigas A; Edbooke DL; Pezzi A; Kesecioglu J; Patroniti N; Baras M; Sprung CL (2010)
    PURPOSE: To identify factors influencing triage decisions and investigate whether admission to the intensive care unit (ICU) could reduce mortality compared with treatment on the ward. METHODS: A multicentre cohort study ...