Results 21 to 30 of about 44,866 (226)
Visualising the structure of document search results: A comparison of graph theoretic approaches [PDF]
, 2009 This is the post-print of the article - Copyright @ 2010 Sage PublicationsPrevious work has shown that distance-similarity visualisation or ‘spatialisation’ can provide a potentially useful context in which to browse the results of a query search ...
Busing F. +7 more
core +1 more source
On the relation between Differential Privacy and Quantitative Information Flow [PDF]
, 2011 Differential privacy is a notion that has emerged in the community of statistical databases, as a response to the problem of protecting the privacy of the database's participants when performing statistical queries.
A. Ghosh +13 more
core +7 more sources
Invariant measures concentrated on countable structures [PDF]
, 2016 Let L be a countable language. We say that a countable infinite L-structure M admits an invariant measure when there is a probability measure on the space of L-structures with the same underlying set as M that is invariant under permutations of that set,
Cameron +13 more
core +2 more sources
Starling flock networks manage uncertainty in consensus at low cost [PDF]
, 2013 Flocks of starlings exhibit a remarkable ability to maintain cohesion as a group in highly uncertain environments and with limited, noisy information.
Cavagna, Andrea +4 more
core +4 more sources
On the usefulness of graph-theoretic properties in the study of perceived numerosity
Behavior Research Methods, 2020 Observers can quickly estimate the quantity of sets of visual elements. Many aspects of this ability have been studied and the underlying system has been called the Approximate Number Sense (Dehaene, 2011).
M. Guest +3 more
semanticscholar +1 more source
Graph Theory and Networks in Biology [PDF]
, 2006 In this paper, we present a survey of the use of graph theoretical techniques in Biology. In particular, we discuss recent work on identifying and modelling the structure of bio-molecular networks, as well as the application of centrality measures to ...
Mason, Oliver, Verwoerd, Mark
core +3 more sources
The Minrank of Random Graphs [PDF]
IEEE Transactions on Information Theory, 2016 The minrank of a directed graph $G$ is the minimum rank of a matrix $M$ that can be obtained from the adjacency matrix of $G$ by switching some ones to zeros (i.e., deleting edges) and then setting all diagonal entries to one.
Alexander Golovnev +2 more
semanticscholar +1 more source
Hardness and Algorithms for Rainbow Connectivity [PDF]
, 2009 An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to make G
Chakraborty, Sourav +3 more
core +4 more sources
Structural Data Recognition with Graph Model Boosting [PDF]
, 2017 This paper presents a novel method for structural data recognition using a large number of graph models. In general, prevalent methods for structural data recognition have two shortcomings: 1) Only a single model is used to capture structural variation ...
Miyazaki, Tomo, Omachi, Shinichiro
core +3 more sources
IEEE transactions on semiconductor manufacturing, 2020 Statistical quality control in semiconductor manufacturing hinges on effective diagnostics of wafer bin maps, wherein a key challenge is to detect how defective chips tend to spatially cluster on a wafer—a problem known as spatial pattern recognition ...
A. Ezzat +3 more
semanticscholar +1 more source