Çizgi ve Çevre

Download
199-222.pdf
1980
Memecan, Salih
Show full item record
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
183
views
39
downloads
http://jfa.arch.metu.edu.tr/archive/0258-5316/1980/cilt06/sayi_2/199-222.pdf
https://hdl.handle.net/11511/51203
Department of Architecture, Article

Suggestions

Rectilinear interdiction problem by locating a line barrier
Gharravi, Hossein Gharehmeshk; Süral, Haldun; Sepil, Canan; Department of Industrial Engineering (2013)
This study is an optimization approach to the rectilinear interdiction problem by locating a line barrier. Interdiction problems study the e ect of a limited disruption action on operations of a system. Network interdiction problems, where nodes and arcs of the network are susceptible to disruption actions, are extensively studied in the operations research literature. In this study, we consider a set of sink points on the plane that are being served by source points and our aim is to study the e ect of loc...
Co-clustering signed 3-partite graphs
Koç, Sefa Şahin; Toroslu, İsmail Hakkı; Department of Computer Engineering (2017)
Real world data is complex and multi-related among itself. Considering a social media, multiple users can interact with same item such as commenting, liking etc. Data composed of these actions contains many nodes from different types (user, item, sentiment). Therefore, clustering nodes with same type will not be sufficient to analyze it. It will ignore relations between nodes from different types. Such data should be dealt with heterogeneous multi-partite clustering methods. Thus, clustering does not ignore...
A Layout algorithm for visualization of graph alignments
Akarsu, Andaç; Can, Tolga; Department of Computer Engineering (2017)
Graph layout algorithms are commonly used when visualizing. Usually these algorithms focus on a single graph. To be able to visualize multiple graphs at once, such as the results of graph alignment algorithms on biological networks, new layout algorithms need to be developed. A layout algorithm for visualizing graph alignments should display the aligned graphs separately, so that both the graphs and their alignment can be viewed individually. In addition, for better interpretation of the alignment results, ...
Task parallelism for ray tracing on a gpu cluster
Ünlü, Çağlar; İşler, Veysi; Department of Computer Engineering (2008)
Ray tracing is a computationally complex global illumination algorithm that is used for producing realistic images. In addition to parallel implementations on commodity PC clusters, recently, Graphics Processing Units (GPU) have also been used to accelerate ray tracing. In this thesis, ray tracing is accelerated on a GPU cluster where the viewing plane is divided into unit tiles. Slave processes work on these tiles in a task parallel manner which are dynamically assigned to them. To decrease the number of r...
Video shot boundary detection by graph theoretic approaches
Aşan, Emrah; Alatan, Abdullah Aydın; Department of Electrical and Electronics Engineering (2008)
This thesis aims comparative analysis of the state of the art shot boundary detection algorithms. The major methods that have been used for shot boundary detection such as pixel intensity based, histogram-based, edge-based, and motion vectors based, are implemented and analyzed. A recent method which utilizes “graph partition model” together with the support vector machine classifier as a shot boundary detection algorithm is also implemented and analyzed. Moreover, a novel graph theoretic concept, “dominant...
Citation Formats
S. Memecan, “Çizgi ve Çevre,” ODTÜ Mimarlık Fakültesi Dergisi, vol. 6, no. 2, pp. 199–222, 1980, Accessed: 00, 2020. [Online]. Available: http://jfa.arch.metu.edu.tr/archive/0258-5316/1980/cilt06/sayi_2/199-222.pdf.
METU IIS - Integrated Information Service open@metu.edu.tr