Výsledky vyhledávání - "Mathematics of computing Discrete mathematics Graph theory Graph enumeration"

Lovász-Type Theorems and Game Comonads Autor Dawar, Anuj, Jakl, Tomas, Reggio, Luca

“…Lovász (1967) showed that two finite relational structures A and B are isomorphic if, and only if, the number of homomorphisms from C to A is the same as the…”
Získat plný text

On the Expressive Power of Homomorphism Counts Autor Atserias, Albert, Kolaitis, Phokion G., Wu, Wei-Lin

“…A classical result by Lovász asserts that two graphs G and H are isomorphic if and only if they have the same left profile, that is, for every graph F, the…”
Získat plný text

A Synchronization-Avoiding Distance-1 Grundy Coloring Algorithm for Power-Law Graphs Autor Firoz, Jesun Sahariar, Zalewski, Marcin, Lumsdaine, Andrew

“…In this paper, we propose a distributed, unordered, label-correcting distance-1 Grundy (vertex) coloring algorithm, namely, Distributed Control (DC) coloring…”
Získat plný text

Efficient Maximal Biclique Enumeration on GPUs Autor Pan, Zhe, He, Shuibing, Li, Xu, Zhang, Xuechen, Wang, Rui, Chen, Gang

“…Maximal biclique enumeration (MBE) in bipartite graphs is an important problem in data mining with many real-world applications. All existing solutions for MBE…”
Získat plný text

Towards a faster network-centric subgraph census Autor Paredes, Pedro, Ribeiro, Pedro

“…Determining the frequency of small subgraphs is an important computational task lying at the core of several graph mining methodologies, such as network motifs…”
Získat plný text

Test Pattern Compression Using Prelude Vectors in Fan-Out Scan Chain with Feedback Architecture Autor Oh, Nahmsuk, Kapur, Rohit, Williams, T. W., Sproch, Jim

“…This paper proposes a new test compression technique that employs Fan-out SCAN chain with Feedback (FSCANF) architecture. It allows us to use prelude vectors…”
Získat plný text

How Does Label Propagation Algorithm Work in Bipartite Networks? Autor Liu, Xin, Murata, Tsuyoshi

“…Community detection in networks receives much attention recently. In this paper, we investigate a recently proposed community detection algorithm—label…”
Získat plný text

Bipartite Graph Based Entity Ranking for Related Entity Finding Autor Lei Cao, Jiafeng Guo, Xueqi Cheng

“…Related entity finding (REF) is a promising application, which aims to return a list of related entities given a query that describes the source entity, the…”
Získat plný text

Social Semantics and Its Evaluation by Means of Semantic Relatedness and Open Topic Models Autor Waltinger, Ulli, Mehler, Alexander

“…This paper presents an approach using social semantics for the task of topic labelling by means of Open Topic Models. Our approach utilizes a social ontology…”
Získat plný text

A Labeled Graph Approach to Analyze Organizational Performance Autor Hoogendoorn, Mark, Treur, Jan, Yolum, Pinar

“…Determining the performance of an organization is a must for both human and multi-agent organizations. The performance analysis enables organizations to…”
Získat plný text

Distributed coloring in Õ (√log n) Bit Rounds Autor Kothapalli, Kishore, Scheideler, Christian, Onus, Melih, Schindelhauer, Christian

“…We consider the well-known vertex coloring problem: given a graph G, find a coloring of the vertices so that no two neighbors in G have the same color. It is…”
Získat plný text

A Multi-stage Graph Decomposition Algorithm for Distributed Constraint Optimisation Autor Law, Terence H. -W., Pearce, Adrian R.

“…In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear…”
Získat plný text

Spill Code Minimization by Spill Code Motion Autor Koseki, Akira, Komatsu, Hideaki, Nakatani, Toshio

“…This paper aims at minimizing the spill costs. Spill cost minimization heuristics that have been researched sometimes work in unexpected ways due to the lack…”
Získat plný text

MRPF: An Architectural Transformation for Synthesis of High-Performance and Low-Power Digital Filters Autor Choo, Hunsoo, Muhammad, Khurram, Roy, Kaushik

“…We present a graph theoretical methodology that reduces the implementation complexity of a vector multiplied by a scalar. The proposed approach is called MRP…”
Získat plný text