Author of the publication

Approximate Shortest Path Queries in Graphs Using Voronoi Duals.

, , , and . ISVD, page 53-62. IEEE Computer Society, (2009)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On the evaluation of unsupervised outlier detection: measures, datasets, and an empirical study, , , , , , , and . Data Mining and Knowledge Discovery, 30 (4): 891--927 (Jul 1, 2016)The vulnerability of learning to adversarial perturbation increases with intrinsic dimensionality., , , , , , and . WIFS, page 1-6. IEEE, (2017)Navigating massive data sets via local clustering.. KDD, page 547-552. ACM, (2003)A correlation-based model for unsupervised feature selection., and . CIKM, page 897-900. ACM, (2007)A partial-order based active cache for recommender systems., , , , and . RecSys, page 209-212. ACM, (2009)Every Set of Disjoint Line Segments Admits a Binary Tree., , and . ISAAC, volume 834 of Lecture Notes in Computer Science, page 20-28. Springer, (1994)Active caching for similarity queries based on shared-neighbor information., , and . CIKM, page 669-678. ACM, (2010)Combinatorial Approaches to Clustering and Feature Selection.. MultiClust@ECML/PKDD, volume 772 of CEUR Workshop Proceedings, page 1-3. CEUR-WS.org, (2011)National Institute of Informatics, Japan at TRECVID 2009., , , , , , and . TRECVID, National Institute of Standards and Technology (NIST), (2009)Approximation Algorithms for Finding Best Viewpoints., and . GD, volume 1547 of Lecture Notes in Computer Science, page 210-223. Springer, (1998)