Browsing by Keywords "Graph Theory"
Now showing items 1-7 of 7
-
Automated construction of fuzzy event sets and its application to active databases
(IEEE, 2001)Fuzzy sets and fuzzy logic research aims to bridge the gap between the crisp world of math and the real world. Fuzzy set theory was applied to many different areas, from control to databases. Sometimes the number of events ... -
Circuit partitioning using mean field annealing
(Elsevier, 1995)Mean field annealing (MFA) algorithm, proposed for solving combinatorial optimization problems, combines the characteristics of neural networks and simulated annealing. Previous works on MFA resulted with successful mapping ... -
Distributed k-Core view materialization and maintenance for large dynamic graphs
(Institute of Electrical and Electronics Engineers, 2014-10)In graph theory, k-core is a key metric used to identify subgraphs of high cohesion, also known as the ‘dense’ regions of a graph. As the real world graphs such as social network graphs grow in size, the contents get ... -
Efficient analysis of large-scale social networks using big-data platforms
(Bilkent University, 2014)In recent years, the rise of very large, rich content networks re-ignited interest to complex/social network analysis at the big data scale, which makes it possible to understand social interactions at large scale while ... -
Hypergraph models and algorithms for data-pattern-based clustering
(Springer, 2004)In traditional approaches for clustering market basket type data, relations among transactions are modeled according to the items occurring in these transactions. However, an individual item might induce different relations ... -
Image-space decomposition algorithms for sort-first parallel volume rendering of unstructured grids
(Springer, 2000)Twelve adaptive image-space decomposition algorithms are presented for sort-first parallel direct volume rendering (DVR) of unstructured grids on distributed-memory architectures. The algorithms are presented under a novel ... -
Two-dimensional packing algorithms for layout of disconnected graphs
(Elsevier, 2002)We present and contrast several efficient two-dimensional packing algorithms for specified aspect ratio. These near-linear algorithms are based on strip packing, tiling, and alternate-bisection methodologies and can be ...
