Results 251 to 260 of about 336,733 (309)
Some of the next articles are maybe not open access.
Private record linkage with linkage maps
SECURITY AND PRIVACY, 2022AbstractPrivate record linkage is an actively pursued research area to facilitate the linkage of database records under the constraints of regulations that do not allow linkage agents to learn sensitive identities of record owners. Recent works have shown that linkage using commutative ciphers, which were discarded earlier for efficiency concerns, can ...
Shreya Patel, Rinku Dewri
openaire +1 more source
Games and Economic Behavior, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sergio Currarini, Carmen Marchiori
openaire +5 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sergio Currarini, Carmen Marchiori
openaire +5 more sources
SIAM Journal on Computing, 1996
The linkage of a graph is defined to be the maximum mm-degree of any of its subgraphs It is known that the linkage of a graph is equal to its width: for an arbitrary linear ordering of the vertices of the graph, consider the maximum, with respect to any vertex v, of the number of vertices connected with v and preceding it in the ordering; the width of ...
Lefteris M. Kirousis +1 more
openaire +2 more sources
The linkage of a graph is defined to be the maximum mm-degree of any of its subgraphs It is known that the linkage of a graph is equal to its width: for an arbitrary linear ordering of the vertices of the graph, consider the maximum, with respect to any vertex v, of the number of vertices connected with v and preceding it in the ordering; the width of ...
Lefteris M. Kirousis +1 more
openaire +2 more sources
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management, 2007
We study the parallelization of the (record) linkage problem - i.e., to identify matching records between two collections of records, A and B. One of main idiosyncrasies of the linkage problem, compared to Database join, is the fact that once two records a in A and b in B are matched and merged to c, c needs to be compared to the rest of records in A ...
Hung-sik Kim, Dongwon Lee 0001
openaire +1 more source
We study the parallelization of the (record) linkage problem - i.e., to identify matching records between two collections of records, A and B. One of main idiosyncrasies of the linkage problem, compared to Database join, is the fact that once two records a in A and b in B are matched and merged to c, c needs to be compared to the rest of records in A ...
Hung-sik Kim, Dongwon Lee 0001
openaire +1 more source
IEEE Transactions on Evolutionary Computation, 2020
Linkage learning is employed by many state-of-the-art evolutionary methods designed for solving problems in discrete domains. The effectiveness of these methods is dependent on linkage quality. The linkage may suffer to two different inaccuracy types. If some of the gene dependencies are not discovered, then the missing linkage takes place. Oppositely,
Marcin Michal Komarnicki +1 more
exaly +3 more sources
Linkage learning is employed by many state-of-the-art evolutionary methods designed for solving problems in discrete domains. The effectiveness of these methods is dependent on linkage quality. The linkage may suffer to two different inaccuracy types. If some of the gene dependencies are not discovered, then the missing linkage takes place. Oppositely,
Marcin Michal Komarnicki +1 more
exaly +3 more sources
Small-world linkage and co-linkage
Proceedings of the twelfth ACM conference on Hypertext and Hypermedia - HYPERTEXT '01, 2001The paper presents ideas from a current research project concerned with link structures and small-world phenomena on the WWW, with possible implications for knowledge discovery or `web mining'. The project includes case studies of so-called co-linkage chains consisting of co-linking and co-linked web nodes (analogous to bibliographic couplings and co ...
openaire +2 more sources