Searching for "The "DGX" distribution for mining massive, skewed data." – sorted by Relevance.
527 documents found, showing 1 through 10.
Next 10 →
-
The "DGX" Distribution for Mining Massive, Skewed Data
- …The “DGX” Distribution for Mining Massive, Skewed Data ABSTRACT Zhiqiang Bi ∗ Physics and CALD…
- Add To MetaCart
-
The "DGX" Distribution for Mining Massive, Skewed Data
- …The "DGX" Distribution for Mining Massive, Skewed Data Zhiqiang Bi # Physics and CALD Carnegie…
- Cited by 27 (7 self) – Add To MetaCart
-
Embeddings of discrete groups and the speed of random walks
- … (x) − f (y)‖ ≥ c · dG(x, y) α . In particular, the Hilbert compression exponent (respectively…
- Cited by 2 (1 self) – Add To MetaCart
-
The maximum distinguishing number of a group
- … faithfully on a set X. The distinguishing number of the action of G on X, denoted DG(X), is the smallest…
- Cited by 4 (0 self) – Add To MetaCart
-
Distance labeling scheme and split decomposition
- … labeling scheme is a distributed data-structure designed to answer queries about distance between any two…
- Cited by 5 (3 self) – Add To MetaCart
-
Collective Additive Tree Spanners of Homogeneously Orderable Graphs [Extended Abstract]
- … graph G admits – a spanning tree T such that, for any two vertices x, y of G, dT (x, y) ≤ dG(x, y) + 3…
- Add To MetaCart
-
Collective tree spanners and routing in AT-free related graphs (extended abstract
- … of G a spanning tree T ∈ T (G) exists such that dT(x, y) ≤ dG(x, y) + r. Among other results, we show…
- Cited by 6 (5 self) – Add To MetaCart
-
25.1 Finite Metric Spaces
- …) be an undirected weighted graph defined over X, and let dG(x, y) be the length of the shortest path between x and y…
- Add To MetaCart
-
Detachment of Vertices of Graphs Preserving Edge-Connectivity
- …The detachment of vertex is the inverse operation of merging vertices s_1,...,s_t into s. We speak about {d_1,...,d_t}-detachment if for the detached graph G' the new degrees are specified as d_{G'}(s_1)=d_1,...,d_{G'}(s_t )=d_t. We call a detachment k-feasible if d_{G'}(X) \geq k whenever X separat…
- Cited by 7 (0 self) – Add To MetaCart
-
Collective Tree Spanners in Graphs with Bounded Parameters
- …) ≤ dG(x, y) + r. We describe a general method for constructing a “small” system of collective additive…
- Cited by 1 (1 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
