Now showing items 978-997 of 1310

    • Quadratic optimality of the zero-phase repetitive control 

      Köroǧlu, H.; Morgül, Ö. (2001)
      We consider the quadratically optimal repetitive control problem in discrete-time and show that the existing zero-phase repetitive controller is quadratically optimal for stable plants. Copyright © 2001 by ASME.
    • Quadrupedal bounding with an actuated spinal joint 

      Çulha, U.; Saranli, U. (2011)
      Most legged vertebrates use flexible spines and supporting muscles to provide auxiliary power and dexterity for dynamic behaviors, resulting in higher speeds and additional maneuverability during locomotion. However, most ...
    • A quadtree-based dynamic attribute indexing method 

      Tayeb, J.; Ulusoy, Ö.; Wolfson, O. (Oxford University Press, 1998)
      Dynamic attributes are attributes that change continuously over time making it impractical to issue explicit updates for every change. In this paper, we adapt a variant of the quadtree structure to solve the problem of ...
    • Qualitative test-cost sensitive classification 

      Cebe, M.; Gunduz Demir, C. (Elsevier BV, 2010)
      This paper reports a new framework for test-cost sensitive classification. It introduces a new loss function definition, in which misclassification cost and cost of feature extraction are combined qualitatively and the ...
    • Quality assessment in the blog space 

      Schaal, M.; Fidan G.; Müller, R.M.; Dagli O. (2010)
      Purpose: The purpose of this paper is the presentation of a new method for blog quality assessment. The method uses the temporal sequence of link creation events between blogs as an implicit source for the collective tacit ...
    • Quantifying genomic privacy via inference attack with high-order SNV correlations 

      Samani, S. S.; Huang, Z.; Ayday, E.; Elliot, M.; Fellay, J.; Hubaux, J.-P.; Kutalik, Z. (Institute of Electrical and Electronics Engineers Inc., 2015)
      As genomic data becomes widely used, the problem of genomic data privacy becomes a hot interdisciplinary research topic among geneticists, bioinformaticians and security and privacy experts. Practical attacks have been ...
    • Quantifying interdependent risks in genomic privacy 

      Humbert M.; Ayday, E.; Hubaux, Jean-Pierre; Telenti A. (Association for Computing Machinery, 2017-02)
      The rapid progress in human-genome sequencing is leading to a high availability of genomic data. These data is notoriously very sensitive and stable in time, and highly correlated among relatives. In this article, we study ...
    • Quasi lumpability, lower-bounding coupling matrices, and nearly completely decomposable Markov chains 

      Dayar T.; Stewart, W. J. (SIAM, 1997)
      In this paper, it is shown that nearly completely decomposable (NCD) Markov chains are quasi-lumpable. The state space partition is the natural one, and the technique may be used to compute lower and upper bounds on the ...
    • Quasi-birth-and-death processes with level-geometric distribution 

      Dayar T.; Quessette, F. (SIAM, 2003)
      A special class of homogeneous continuous-time quasi-birth-and-death (QBD) Markov chains (MCS) which possess level-geometric (LG) stationary distribution is considered. Assuming that the stationary vector is partitioned ...
    • Query expansion with terms selected using lexical cohesion analysis of documents 

      Vechtomova, O.; Karamuftuoglu, M. (Elsevier Ltd, 2007-07)
      We present new methods of query expansion using terms that form lexical cohesive links between the contexts of distinct query terms in documents (i.e., words surrounding the query terms in text). The link-forming terms ...
    • Query forwarding in geographically distributed search engines 

      Cambazoglu, B.B.; Varol, E.; Kayaaslan, E.; Aykanat, C.; Baeza-Yates, R. (2010)
      Query forwarding is an important technique for preserving the result quality in distributed search engines where the index is geographically partitioned over multiple search sites. The key component in query forwarding is ...
    • Query model for object-oriented databases 

      Alhajj, Reda; Arkun, M. Erol (IEEE, 1993-04)
      A query language should be a part of any database system. While the relational model has a well defined underlying query model, the object-oriented database systems have been criticized for not having such a query model. ...
    • Query Processing in Context - Oriented Retrieval of Information 

      Saygin, A.P.; Yavuz, T. (1998)
      This paper proposes a context-oriented approach towards document retrieval and presents the query processing component of the retrieval process in detail. Our approach differs from the existing ones by its use of word sense ...
    • Query-log aware replicated declustering 

      Turk, A.; Oktay, K. Y.; Aykanat, C. (Institute of Electrical and Electronics Engineers, 2013)
      Data declustering and replication can be used to reduce I/O times related with processing of data intensive queries. Declustering parallelizes the query retrieval process by distributing the data items requested by queries ...
    • Querying web metadata: Native score management and text support in databases 

      Özsoyoǧlu, G.; Altingövde, I. S.; Al-Hamdani, A.; Özel, S. A.; Ulusoy, Ö.; Özsoyoǧlu, Z. M. (Association for Computing Machinery, 2004)
      In this article, we discuss the issues involved in adding a native score management system to object-relational databases, to be used in querying Web metadata (that describes the semantic content of Web resources). The Web ...
    • RailwayDB: adaptive storage of interaction graphs 

      Soulé R.; Gedik, B. (Association for Computing Machinery, 2016)
      We are living in an ever more connected world, where data recording the interactions between people, software systems, and the physical world is becoming increasingly prevalent. These data often take the form of a temporally ...
    • Ranking instances by maximizing the area under ROC curve 

      Guvenir, H. A.; Kurtcephe, M. (Institute of Electrical and Electronics Engineers, 2013)
      In recent years, the problem of learning a real-valued function that induces a ranking over an instance space has gained importance in machine learning literature. Here, we propose a supervised algorithm that learns a ...
    • A ranking method for example based machine translation results by learning from user feedback 

      Daybelge, T.; Cicekli, I. (Springer New York LLC, 2011-10)
      Example-Based Machine Translation (EBMT) is a corpus based approach to Machine Translation (MT), that utilizes the translation by analogy concept. In our EBMT system, translation templates are extracted automatically from ...
    • Rate-distortion based piecewise planar 3D scene geometry representation 

      Imre, E.; Alatan, A.A.; Güdükbay, U. (2006)
      This paper proposes a novel 3D piecewise planar reconstruction algorithm, to build a 3D scene representation that minimizes the intensity error between a particular frame and its prediction. 3D scene geometry is exploited ...
    • Rate-distortion efficient piecewise planar 3-D scene representation from 2-D images 

      İmre, E.; Alatan, A. A.; Güdükbay U. (Institute of Electrical and Electronics Engineers, 2009-03)
      In any practical application of the 2-D-to-3-D conversion that involves storage and transmission, representation effi- ciency has an undisputable importance that is not reflected in the attention the topic received. In ...