Robust random cut forest based anomaly detection on streams
In this paper we focus on the anomaly detection problem for dynamic data streams through
the lens of random cut forests. We investigate a robust random cut data structure that can be …
the lens of random cut forests. We investigate a robust random cut data structure that can be …
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
In this article, we give an overview of efficient algorithms for the approximate and exact
nearest neighbor problem. The goal is to preprocess a dataset of objects (eg, images) so …
nearest neighbor problem. The goal is to preprocess a dataset of objects (eg, images) so …
[書籍][B] Distributed computing: a locality-sensitive approach
D Peleg - 2000 - SIAM
Distributed computing concerns environments in which many processors, located at different
sites, must operate in a noninterfering and cooperative manner. Each of the processors …
sites, must operate in a noninterfering and cooperative manner. Each of the processors …
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution
over dominating tree metrics such that the expected stretch of any edge is O (log n). This …
over dominating tree metrics such that the expected stretch of any edge is O (log n). This …
Multiway spectral partitioning and higher-order cheeger inequalities
A basic fact in spectral graph theory is that the number of connected components in an
undirected graph is equal to the multiplicity of the eigenvalue zero in the Laplacian matrix of …
undirected graph is equal to the multiplicity of the eigenvalue zero in the Laplacian matrix of …
[書籍][B] Representations for genetic and evolutionary algorithms
F Rothlauf, F Rothlauf - 2006 - Springer
2 Representations for Genetic and Evolutionary Algorithms Page 1 2 Representations for Genetic
and Evolutionary Algorithms In this second chapter, we present an introduction into the field of …
and Evolutionary Algorithms In this second chapter, we present an introduction into the field of …
Optimal hierarchical decompositions for congestion minimization in networks
H Räcke - Proceedings of the fortieth annual ACM symposium on …, 2008 - dl.acm.org
Hierarchical graph decompositions play an important role in the design of approximation
and online algorithms for graph problems. This is mainly due to the fact that the results …
and online algorithms for graph problems. This is mainly due to the fact that the results …
Approximation algorithms for network design: A survey
Network Design is an active research area in the intersection of Combinatorial Optimization
and Theoretical Computer Science that focuses on problems arising in the realm of modern …
and Theoretical Computer Science that focuses on problems arising in the realm of modern …
Algorithmic applications of low-distortion geometric embeddings
P Indyk - Proceedings 42nd IEEE Symposium on Foundations …, 2001 - ieeexplore.ieee.org
The author surveys algorithmic results obtained using low-distortion embeddings of metric
spaces into (mostly) normed spaces. He shows that low-distortion embeddings provide a …
spaces into (mostly) normed spaces. He shows that low-distortion embeddings provide a …
Strengthening integrality gaps for capacitated network design and covering problems
RD Carr, LK Fleischer, VJ Leung, CA Phillips - 1999 - osti.gov
A capacitated covering IP is an integer program of the form min {l_brace} ex {vert_bar} Ux
{ge} d, 0 {le} x {le} b, x {element_of} Z {sup+}{r_brace}, where all entries of c, U, and d are …
{ge} d, 0 {le} x {le} b, x {element_of} Z {sup+}{r_brace}, where all entries of c, U, and d are …