Results 241 to 250 of about 1,522,365 (296)
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 +4 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sergio Currarini, Carmen Marchiori
openaire +4 more sources
SIAM Journal on Computing, 1996
Summary: The linkage of a graph is defined to be the maximum min-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 ...
Lefteris M. Kirousis +1 more
openaire +2 more sources
Summary: The linkage of a graph is defined to be the maximum min-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 ...
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
Direct linkage discovery with empirical linkage learning
Proceedings of the Genetic and Evolutionary Computation Conference, 2021Problem decomposition is an important part of many state-of-the-art Evolutionary Algorithms (EAs). The quality of the decomposition may be decisive for the EA effectiveness and efficiency. Therefore, in this paper, we focus on the recent proposition of Linkage Learning based on Local Optimization (3LO).
Michal Witold Przewozniczek +2 more
openaire +1 more source
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 +1 more source
Journal of Organizational Change Management, 2004
Entrainment is a theory of causality wherein different but proximate actants are tied to one another in complementary rhythms. Entrainment proposes a naturalism of interrelatedness. Manuel DeLanda has explored the logic of social entrainment. Opposing assumptions are found in Actor Network Theory.
Hagemeijer, RE, Letiche, HK
openaire +1 more source
Entrainment is a theory of causality wherein different but proximate actants are tied to one another in complementary rhythms. Entrainment proposes a naturalism of interrelatedness. Manuel DeLanda has explored the logic of social entrainment. Opposing assumptions are found in Actor Network Theory.
Hagemeijer, RE, Letiche, HK
openaire +1 more source
1974
Assembly is the final step in the translation to machine code. Instruction specifications are converted into the actual patterns recognized by the control unit of the computer, and these patterns are placed into a memory image. Some of the instruction specifications normally contain references to other items in the program; during assembly, these ...
openaire +1 more source
Assembly is the final step in the translation to machine code. Instruction specifications are converted into the actual patterns recognized by the control unit of the computer, and these patterns are placed into a memory image. Some of the instruction specifications normally contain references to other items in the program; during assembly, these ...
openaire +1 more source
2011
Linkage analysis is used to map genetic loci using observations on relatives. It can be applied to both major gene disorders (parametric linkage) and complex diseases (model-free or non-parametric linkage), and it can be based on either a relatively small number of microsatellite markers or a denser map of single nucleotide polymorphisms (SNPs).
Jennifer H, Barrett, M Dawn, Teare
openaire +2 more sources
Linkage analysis is used to map genetic loci using observations on relatives. It can be applied to both major gene disorders (parametric linkage) and complex diseases (model-free or non-parametric linkage), and it can be based on either a relatively small number of microsatellite markers or a denser map of single nucleotide polymorphisms (SNPs).
Jennifer H, Barrett, M Dawn, Teare
openaire +2 more sources
Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion, 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,
Michal Witold Przewozniczek +1 more
openaire +1 more source
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,
Michal Witold Przewozniczek +1 more
openaire +1 more source