( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Efficient algorithms for clone items detection.

, , и . CLA, том 162 из CEUR Workshop Proceedings, CEUR-WS.org, (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Hélène Raoult

Olivier Raoult

Ramiro Medina

Eva Medina

Loreta Medina

 

Другие публикации лиц с тем же именем

Uncovering and Reducing Hidden Combinatorics in Guigues-Duquenne Bases., , , и . ICFCA, том 3403 из Lecture Notes in Computer Science, стр. 235-248. Springer, (2005)Efficient algorithms for clone items detection., , и . CLA, том 162 из CEUR Workshop Proceedings, CEUR-WS.org, (2005)Efficient Reconstruction of the Causal Relationship in Distributed Systems., , , , и . Canada-France Conference on Parallel and Distributed Computing, том 805 из Lecture Notes in Computer Science, стр. 101-113. Springer, (1994)About the Enumeration Algorithms of Closed Sets., , и . ICFCA, том 5986 из Lecture Notes in Computer Science, стр. 1-16. Springer, (2010)Conditional Functional Dependencies: An FCA Point of View., и . ICFCA, том 5986 из Lecture Notes in Computer Science, стр. 161-176. Springer, (2010)Interactive Association Rules Discovery., , и . ICFCA, том 3874 из Lecture Notes in Computer Science, стр. 177-190. Springer, (2006)Representing lattices using many-valued relations., , и . Inf. Sci., 179 (16): 2729-2739 (2009)Efficient algorithms on distributive lattices., , , и . Discret. Appl. Math., 110 (2-3): 169-187 (2001)A Unified Hierarchy for Functional Dependencies, Conditional Functional Dependencies and Association Rules., и . ICFCA, том 5548 из Lecture Notes in Computer Science, стр. 98-113. Springer, (2009)Incremental Garbage Collection for Causal Relationship Computation in Distributed Systems.. SPDP, стр. 650-655. IEEE Computer Society, (1993)