|
|
|
András Hubai, Sándor Szabó and Bogdán Zaválnij
The principal component analysis is a well-known and widely used technique to determine the essential dimension of a data set. Broadly speaking, it aims to find a low-dimensional linear manifold that retains a large part of the information contained in t...
ver más
|
|
|
|
|
|
|
Renaud Fabre, Otmane Azeroual, Joachim Schöpfel, Patrice Bellot and Daniel Egret
The digital support for scientific reasoning presents contrasting results. Bibliometric services are improving, but not academic assessment; no service for scholars relies on logs of web usage to base query strategies for relevance judgments (or assessor...
ver más
|
|
|
|
|
|
|
Renaud Fabre, Otmane Azeroual, Patrice Bellot, Joachim Schöpfel and Daniel Egret
The variety and diversity of published content are currently expanding in all fields of scholarly communication. Yet, scientific knowledge graphs (SKG) provide only poor images of the varied directions of alternative scientific choices, and in particular...
ver más
|
|
|
|
|
|
|
Baihan Lin
The absence of a conventional association between the cell?cell cohabitation and its emergent dynamics into cliques during development has hindered our understanding of how cell populations proliferate, differentiate, and compete (i.e., the cell ecology)...
ver más
|
|
|
|
|
|
|
Yinan Chen, Chuanpeng Wang and Dong Li
Complex networks usually consist of dense-connected cliques, which are defined as communities. A community structure is a reflection of the local characteristics existing in the network topology, this makes community detection become an important researc...
ver más
|
|
|
|
|
|
|
Jinyu Guo and Lizhen Wang
The goal of spatial co-location pattern mining is to find subsets of spatial features whose instances are often neighbors in a geographical space. In many practical cases, instances of spatial features contain not only spatial location information but al...
ver más
|
|
|
|
|
|
|
Miroslaw Kowaluk and Andrzej Lingas
We introduce the concept of a k-dimensional matrix product D of k matrices A1,…,Ak" role="presentation">??1,?,????A1,?,Ak
A
1
,
?
,
A
k
of sizes n1×n,…,nk×n," role="presentation">??1×??,?,????×??,n1×n,?,nk×n,
n
1
...
ver más
|
|
|
|
|
|
|
Patrizio Angelini, Peter Eades, Seok-Hee Hong, Karsten Klein, Stephen Kobourov, Giuseppe Liotta, Alfredo Navarra and Alessandra Tappini
This paper introduces and studies the following beyond-planarity problem, which we call h-Clique2Path Planarity. Let G be a simple topological graph whose vertices are partitioned into subsets of size at most h, each inducing a clique. h-Clique2Path Plan...
ver más
|
|
|
|
|
|
|
Charles A. Phillips, Kai Wang, Erich J. Baker, Jason A. Bubier, Elissa J. Chesler and Michael A. Langston
Let k denote an integer greater than 2, let G denote a k-partite graph, and let S denote the set of all maximal k-partite cliques in G. Several open questions concerning the computation of S are resolved. A straightforward and highly-scalable modificatio...
ver más
|
|
|
|
|
|
|
Kerri Morgan,Marc Cheong,Susan Bedingfield
Social media provides people from all socio-economic sectors with the opportunity to voice their opinions. Platforms such as Twitter provide the means to share one?s opinion with little effort and cost. But do these media empower everyday people to make ...
ver más
|
|
|
|