From post

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.

 

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

Every Set of Disjoint Line Segments Admits a Binary Tree., , и . ISAAC, том 834 из Lecture Notes in Computer Science, стр. 20-28. Springer, (1994)The vulnerability of learning to adversarial perturbation increases with intrinsic dimensionality., , , , , , и . WIFS, стр. 1-6. IEEE, (2017)Navigating massive data sets via local clustering.. KDD, стр. 547-552. ACM, (2003)A partial-order based active cache for recommender systems., , , , и . RecSys, стр. 209-212. ACM, (2009)A correlation-based model for unsupervised feature selection., и . CIKM, стр. 897-900. ACM, (2007)Active caching for similarity queries based on shared-neighbor information., , и . CIKM, стр. 669-678. ACM, (2010)On the evaluation of unsupervised outlier detection: measures, datasets, and an empirical study, , , , , , , и . Data Mining and Knowledge Discovery, 30 (4): 891--927 (01.07.2016)Combinatorial Approaches to Clustering and Feature Selection.. MultiClust@ECML/PKDD, том 772 из CEUR Workshop Proceedings, стр. 1-3. CEUR-WS.org, (2011)National Institute of Informatics, Japan at TRECVID 2009., , , , , , и . TRECVID, National Institute of Standards and Technology (NIST), (2009)The Wobbly Logic Engine: Proving Hardness of Non-rigid Geometric Graph Representation Problems., , и . GD, том 1353 из Lecture Notes in Computer Science, стр. 272-283. Springer, (1997)