Výsledky vyhľadávania - graph algorithms in informatik

Graph theoretic methods in multiagent networks Autor Mesbahi, Mehran, Egerstedt, Magnus

“… Focusing on graph theoretic methods for the analysis and synthesis of dynamic multiagent networks, the book presents a powerful new formalism and set of tools for networked systems…”
Získať plný text

The structure and dynamics of networks Autor Newman, Mark, Barabási, Albert-László, Watts, Duncan J

“…From the Internet to networks of friendship, disease transmission, and even terrorism, the concept--and the reality--of networks has come to pervade modern…”
Získať plný text

Time-optimal construction of overlay networks Autor Götte, Thorsten, Hinnenthal, Kristian, Scheideler, Christian, Werthmann, Julian

“… Suppose the initial network’s graph is weakly connected and has constant degree. In that case, our algorithm constructs the desired topology with each node sending and receiving only O ( log n…”
Získať plný text

Advanced Machine Learning Applications in Big Data Analytics

“…With the development of computer technology and communication technology, various industries have collected a large amount of data in different forms,…”
Získať plný text

Centrality Measures in multi-layer Knowledge Graphs Autor Jens Dörpinghaus, Vera Weil, Carsten Düing, Martin W. Sommer

Získať plný text

Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant Autor Guruswami, Venkatesan, HÅstad, Johan, Manokaran, Rajsekar, Raghavendra, Prasad, Charikar, Moses

“…: given a directed graph G that has an acyclic subgraph consisting of a fraction (1 - ε) of its edges, it is UG-hard to find one with more than…”
Získať plný text

Applied Machine Learning

“…This reprint focuses on applications of machine learning models in a diverse range of fields and problems. It reports substantive results on a wide range of…”
Získať plný text

Theoretische Informatik - ganz praktisch Autor König, Lukas, Pfeiffer-Bohnen, Friederike, Schmeck, Hartmut

“…Die theoretische Informatik ist für viele Studierende ein Schreckgespenst, weil formale Einstiegshürden…”
Získať plný text

An Efficient Algorithm for All-Pairs Bounded Edge Connectivity Autor Akmal, Shyan, Jin, Ce

“…Our work concerns algorithms for a variant of Maximum Flow in unweighted graphs. In the All-Pairs Connectivity (APC…”
Získať plný text

Stable networks and product graphs Autor Feder, Tomás

“…A network is a collection of gates, each with many inputs and many outputs, where links join individual outputs to individual inputs of gates; the unlinked…”
Získať plný text

Evolving interpretable structure-activity relationship models. 2. Using multiobjective optimization to derive multiple models Autor Birchall, Kristian, Gillet, Valerie J, Harper, Gavin, Pickett, Stephen D

“…A multiobjective evolutionary algorithm (MOEA) is described for evolving multiple structure-activity relationships (SARs…”
Zistit podrobnosti o prístupe

Algorithmen - Eine Einführung Autor Cormen, Thomas H

“…Der "Cormen" bietet eine umfassende und vielseitige Einführung in das moderne Studium von Algorithmen…”
Získať plný text

How to Think About Algorithms Autor Edmonds, Jeff

“…This textbook, for second- or third-year students of computer science, presents insights, notations, and analogies to help them describe and think about algorithms like an expert, without grinding…”
Získať plný text

First Working Conference on Artificial Intelligence Development for a Resilient and Sustainable Tomorrow: AI Tomorrow 2023 Autor Zinke-Wehlmann, Christian, Friedrich, Julia

“…Künstliche Intelligenz ist ein Treiber der digitalen Transformation von Unternehmen, welche die gesamte Organisation, einschließlich ihrer Strukturen, Prozesse…”
Získať plný text

Pre-Processing Structured Data for Standard Machine Learning Algorithms by Supervised Graph Propositionalization - A Case Study with Medicinal Chemistry Datasets Autor Karunaratne, Thashmee, Bostrom, Henrik, Norinder, U

“…Graph propositionalization methods can be used to transform structured and relational data into fixed-length feature vectors, enabling standard machine learning algorithms to be used for generating predictive models…”
Získať plný text

Parallelized short read assembly of large genomes using de Bruijn graphs Autor Liu, Yongchao, Schmidt, Bertil, Maskell, Douglas L

“… Results We present PASHA, a parallelized short read assembler using de Bruijn graphs, which takes advantage of hybrid computing architectures consisting of both shared-memory multi-core CPUs…”
Získať plný text

Compression Algorithm for Colored de Bruijn Graphs Autor Rahman, Amatur, Dufresne, Yoann, Medvedev, Paul

“…A colored de Bruijn graph (also called a set of k-mer sets), is a set of k-mers with every k-mer assigned a set of colors…”
Zistit podrobnosti o prístupe

New Parameterized Algorithms for Matching and Packing Problems Autor Koana, Tomohiro

“…Diese Arbeit betrachtet parametrisierte Algorithmen für Matching- und Packungsprobleme, deren Erforschung in der Informatik weit verbreitet ist…”
Získať plný text

Planar Polyline Drawings via Graph Transformations Autor Zhang, Huaming

“…We study the problem of transforming plane triangulations into irreducible triangulations, which are plane graphs with a quadrangular exterior face, triangular interior faces and no separating triangles…”
Získať plný text

Improved bounds for minimal feedback vertex sets in tournaments Autor Mnich, M., Teutrine, E.

“…We study feedback vertex sets (FVS) in tournaments, which are orientations of complete graphs…”
Získať plný text