Essays about: "crossing edges"
Showing result 1 - 5 of 7 essays containing the words crossing edges.
-
1. Interactive Visual Analysis of Hypergraphs
University essay from Linnéuniversitetet/Institutionen för datavetenskap och medieteknik (DM)Abstract : Access to and understanding data plays an essential role in the increasingly digital world. Representation and analysis of relations between various data entities, i.e., graph and network structures in the data, is an important problem for various industries. READ MORE
-
2. Investigation Of The Influence Of Geometrical Parameters On Heat Transfer In Matrix Cooling : A Computational Fluid Dynamics Approach
University essay from Linköpings universitet/Mekanisk värmeteori och strömningsläraAbstract : Modern gas turbine blades and vanes are operated at temperatures above their material’s melting point. Active external and internal cooling are therefore necessary to reach acceptable lifetimes. One possible internal cooling method is called matrix cooling, where a matrix of intersecting cooling air channels is integrated into a blade or vane. READ MORE
-
3. Water assisted CO intercalation underneath Ir(111) supported graphene studied with scanning tunneling microscopy
University essay from Lunds universitet/Synkrotronljusfysik; Lunds universitet/Fysiska institutionenAbstract : Graphene have attracted attention recently due to its unique properties and opportunities for development of high performance carbon based devices. The intercalation, absorption and reactions processes of small molecules above and below the graphene islands hold the key for new perspectives in catalysis, molecular sensors and other technologies. READ MORE
-
4. Improved inapproximability of Max-Cut through Min-Cut
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : A cut is a partition of a graph's nodes into two sets, and we say that an edge crosses the cut if it connects two nodes belonging to different sets. A maximum cut is a cut that maximises the number of crossing edges. READ MORE
-
5. Dynamic Programming Algorithms for Semantic Dependency Parsing
University essay from Linköpings universitet/Interaktiva och kognitiva systemAbstract : Dependency parsing can be a useful tool to allow computers to parse text. In 2015, Kuhlmann and Jonsson proposed a logical deduction system that parsed to non-crossing dependency graphs with an asymptotic time complexity of O(n3), where “n” is the length of the sentence to parse. READ MORE