Now showing items 1-20 of 29

    • Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids 

      Aykanat, C.; Cambazoglu, B. B.; Findik, F.; Kurc, T. (Academic Press, 2007-01)
      Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS decomposition problem is modeled as a graph ...
    • Binary morphological subband decomposition for image coding 

      Gurcan, M. N.; Gerek, O. N.; Cetin, A. E. (IEEE, Piscataway, NJ, United States, 1996)
      In this paper a binary waveform coding method based on morphological subband decomposition coupled with embedded zero-tree and entropy coding is described. This method can be utilized in text compression or bit-plane coding ...
    • CAPSULE: Language and system support for efficient state sharing in distributed stream processing systems 

      Losa G.; Kumar V.; Andrade H.; Gedik, B.; Hirzel, M.; Soulé, R.; Wu, K.-L. (2012)
      Data stream processing applications are often expressed as data flow graphs, composed of operators connected via streams. This structured representation provides a simple yet powerful paradigm for building large-scale, ...
    • A comparison of historical relational query languages 

      Tansel, A. U.; Tin, E. (ASME, 1994)
      We introduce a historical relational data model in which N1NF relations are used and 1-level of nesting is allowed. Attributes can either be atomic or temporal atom. An atomic attribute represents a time invariant attribute. ...
    • Computational pan-genomics: status, promises and challenges 

      The Computational Pan-Genomics Consortium; Alkan C. (Oxford University Press, 2018-01-01)
      Many disciplines, from human genetics and oncology to plant breeding, microbiology and virology, commonly face the challenge of analyzing rapidly increasing numbers of genomes. In case of Homo sapiens, the number of ...
    • Distance-based classification methods 

      Ekin, O.; Hammer, P. L.; Kogan, A.; Winter, P. (Taylor & Francis, 1999)
      Given a set of points in a Euclidean space, and a partitioning of this 'training set' into two or more subsets ('classes'), we consider the problem of identifying a 'reasonable' assignment of another point in the Euclidean ...
    • Editing heightfield using history management and 3D widgets 

      Yalcin, M.A.; Capin, T.K. (2009)
      In virtual environments, terrain is generally modeled by heightfield, a 2D structure. To be able to create desired terrain geometry, software editors for this specific task have been developed. The graphics hardware, data ...
    • Effective use of space for pivot-based metric indexing structures 

      Celik, C. (2008)
      Among the metric space indexing methods, AESA is known to produce the lowest query costs in terms of the number of distance computations. However, its quadratic construction cost and space consumption makes it infeasiblefor ...
    • Efficiency and effectiveness of query processing in cluster-based retrieval 

      Can, F.; Altingövde I.S.; Demir, E. (Elsevier, 2004)
      Our research shows that for large databases, without considerable additional storage overhead, cluster-based retrieval (CBR) can compete with the time efficiency and effectiveness of the inverted index-based full search ...
    • An efficient algorithm for the single machine total tardiness problem 

      Tansel, B. Ç.; Kara, B. Y.; Sabuncuoğlu İ. (Taylor & Francis, 2001)
      This paper presents an exact algorithm for the single machine total tardiness problem (1// L T;). We present a new synthesis of various results from the literature which leads to a compact and concise representation of job ...
    • Efficient parallel spatial subdivision algorithm for object-based parallel ray tracing 

      Aykanat, C.; İşler, V.; Özgüç, B. (Pergamon Press, 1994)
      Parallel ray tracing of complex scenes on multicomputers requires the distribution of both computation and scene data to the processors. This is carried out during preprocessing and usually consumes too much time and memory. ...
    • Efficient vectorization of forward/backward substitutions in solving sparse linear equations 

      Aykanat, C.; Özgü, Ö.; Güven, N. (IEEE, 1994)
      Vector processors have promised an enormous increase in computing speed for computationally intensive and time-critical power system problems which require the repeated solution of sparse linear equations. Due to short ...
    • FAME: Face Association through Model Evolution 

      Golge, E.; Duygulu P. (IEEE Computer Society, 2014)
      We attack the problem of building classifiers for public faces from web images collected through querying a name. The search results are very noisy even after face detection, with several irrelevant faces corresponding to ...
    • Human action recognition using distribution of oriented rectangular patches 

      Ikizler, N.; Duygulu P. (2007)
      We describe a "bag-of-rectangles" method for representing and recognizing human actions in videos. In this method, each human pose in an action sequence is represented by oriented rectangular patches extracted over the ...
    • Incremental materialization of object-oriented views 

      Alhajj, R.; Elnagar, A. (Elsevier, 1999)
      We present an approach to handle incremental materialization of object-oriented views. Queries that define views are implemented as methods that are invoked to compute corresponding views. To avoid computation from scratch ...
    • Lossless image compression by LMS adaptive filter banks 

      Öktem, R.; Çetin, A. E.; Gerek, O. N.; Öktem, L.; Egiazarian, K. (Elsevier, 2001)
      A lossless image compression algorithm based on adaptive subband decomposition is proposed. The subband decomposition is achieved by a two-channel LMS adaptive filter bank. The resulting coefficients are lossy coded first, ...
    • Mars: A tool-based modeling, animation, and parallel rendering system 

      Aktıhanoğlu, M.; Özgüç, B.; Aykanat, C. (Springer, 1994)
      This paper describes a system for modeling, animating, previewing and rendering articulated objects. The system has a modeler of objects that consists of joints and segments. The animator interactively positions the ...
    • MLFMA memory reduction techniques for solving large-scale problems 

      Hidayetoglu, M.; Gurel L. (Institute of Electrical and Electronics Engineers Inc., 2014)
      We present two memory reduction methods for the parallel multilevel fast multipole algorithm. One of these methods uses data structures out of core, and the other parallelizes the data structures related to input geometry. ...
    • Morphological subband decomposition structure using GF(N) arithmetic 

      Gurcan Metin Nafi, Gerek Omer, N.; Cetin, A.Enis; Gerek, O. N.; Cetin, A. E. (IEEE, Los Alamitos, CA, United States, 1996)
      Linear filter banks with critical subsampling and perfect reconstruction (PR) property have received much interest and found numerous applications in signal and image processing. Recently, nonlinear filter bank structures ...
    • Multirelational k-anonymity 

      Nergiz, M. E.; Clifton, C.; Nergiz, A. E. (2007)
      k-Anonymity protects privacy by ensuring that data cannot be linked to a single individual. In a k-anonymous dataset, any identifying information occurs in at least k tuples. Much research has been done to modify a single ...