Browsing by Keywords "Graph algorithms"
Now showing items 1-11 of 11
-
Automated layout of process description maps drawn in systems biology graphical notation = Systems biology graphical notation kullanılarak çizilen proses diyagramlarının otomatik yerleştirilmesi
(Bilkent University, 2014)Evolving technology has increased the focus on genomics. The combination of today’s advanced studies with decades of molecular biology research yield in huge amount of pathway data. These models can be used to improve ... -
CiSE: a circular spring embedder layout algorithm
(Institute of Electrical and Electronics Engineers, 2013)We present a new algorithm for automatic layout of clustered graphs using a circular style. The algorithm tries to determine optimal location and orientation of individual clusters intrinsically within a modified spring ... -
A compound graph layout algorithm with support for ports
(Bilkent University, 2020-10)Information visualization is a eld of study that aims to represent abstract data in an aesthetically pleasing and easy to comprehend visual manner. Various approaches and standards have been created to reinforce the ... -
Efficient querying of SBGN maps stored in a graph database
(Bilkent University, 2019-02)Graph visualization is an important research area that endeavors to make graphs more understandable and easier to analyze. In various domains, graph visualization techniques and standards are developed to effectively ... -
Hydra: Detecting fraud in financial transactions via graph based representation and visual analysis
(IEEE, 2020)In this paper, we describe a web based tool named Hydra for analyzing financial transaction data with the aim to detect or verify fraudulent activities via visual analysis and graph based querying. Hydra exclusively uses ... -
Improving efficiency of parallel vertex-centric algorithms for irregular graphs
(IEEE Computer Society, 2019)Memory access is known to be the main bottleneck for shared-memory parallel graph applications especially for large and irregular graphs. Propagation blocking (PB) idea was proposed recently to improve the parallel performance ... -
Incremental k-core decomposition: algorithms and evaluation
(Association for Computing Machinery, 2016)A k-core of a graph is a maximal connected subgraph in which every vertex is connected to at least k vertices in the subgraph. k-core decomposition is often used in large-scale network analysis, such as community detection, ... -
OpenCL-based efficient HLS implementation of iterative graph algorithms on FPGA
(Bilkent University, 2020-12)The emergence of CPU-FPGA hybrid architectures creates a demand for high abstraction programming tools such as High-Level Synthesis (HLS). HLS handles most of the FPGA development tasks automatically, thus freeing up ... -
Re-ranking of web image search results using a graph algorithm
(IEEE, 2008-12)We propose a method to improve the results of image search engines on the Internet to satisfy users who desire to see relevant images in the first few pages. The method re-ranks the results of text based systems by ... -
Resim arama sonuçlarının çizge tabanlı bir yöntemle yeniden sıralanması
(IEEE, 2008-04)Arama motorları aracılığı ile arama yapmak günümüzde internetin en yaygın kullanım amaçlarından biridir. Ancak sorgu sonuçları, özellikle resim arama sorgularında, çoğu zaman sorgu ile ilgli olmayan sonuçlar da içerebilmektedir. ... -
Semantic validation of biological maps in SBGN
(Bilkent University, 2019-09)Graph visualization is a research field where relational information is graphically represented in the form of graphs or networks. It is applicable in numerous areas from computer network systems, to biology, to software ...
