Results 1  10
of
632
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
, 2000
"... In this paper we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: ffl we show how to maintain (using only O(log n=ffl 2 ) words of storage) a sketch C(p) of a point p 2 l n 1 under dynamic updates of its coo ..."
Abstract

Cited by 324 (13 self)
 Add to MetaCart
(n) is much smaller than n; to our knowledge this is the first dimensionality reduction lemma for l 1 norm ffl we give an explicit embedding of l n 2 into l n O(log n) 1 with distortion (1 + 1=n \Theta(1) ) and a nonconstructive embedding of l n 2 into l O(n) 1 with distortion (1 + ffl
CONSTRUCTIVE POINTFREE TOPOLOGY ELIMINATES NONCONSTRUCTIVE REPRESENTATION THEOREMS FROM RIESZ SPACE THEORY
, 807
"... Abstract. In Riesz space theory it is good practice to avoid representation theorems which depend on the axiom of choice. Here we present a general methodology to do this using pointfree topology. To illustrate the technique we show that almost falgebras are commutative. The proof is obtained relat ..."
Abstract
 Add to MetaCart
spectrum. Theorem 1. [StoneYosida] Let R be an Archimedean Riesz space (vector lattice) with unit. Let Σ be its (compact Hausdorff) space of representations. Define the continuous function ˆr(σ): = σ(r) on Σ. Then r ↦ → ˆr is a Riesz embedding of R into C(Σ,). The theorem is very convenient, but sometimes
An algorithmic Friedman–Pippenger theorem on tree embeddings and applications to routing
 In SODA ’06: Proceedings of the seventeenth annual ACMSIAM symposium on Discrete algorithm
, 2006
"... Abstract. An (n, d)expander is a graph G = (V, E) such that for every X ⊆ V with X  ≤ 2n − 2 we have ΓG(X)  ≥ (d+1)X. A tree T is small if it has at most n vertices and has maximum degree at most d. Friedman and Pippenger (1987) proved that any (n, d)expander contains every small tree. How ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
for such previously nonconstructive applications. As an example, we discuss a recent result of Alon, Krivelevich, and Sudakov concerning embedding nearly spanning bounded degree trees, the proof of which makes use of the Friedman–Pippenger theorem. We shall also show a construction inspired on Wigderson
Structural and Algorithmic Aspects of Chordal Graph Embeddings
, 1996
"... In this thesis, we consider graph embeddings into the class of chordal graphs (socalled triangulations), by which, for greater classes of graphs, we obtain new structural results and efficient algorithms for computing various graph parameters. The minimal separators in a graph play an important rol ..."
Abstract
 Add to MetaCart
In this thesis, we consider graph embeddings into the class of chordal graphs (socalled triangulations), by which, for greater classes of graphs, we obtain new structural results and efficient algorithms for computing various graph parameters. The minimal separators in a graph play an important
Two Embedding Theorems for Data with Equivalences under Finite Group Action
"... There is recent interest in compressing data sets for nonsequential settings, where lack of obvious orderings on their data space, require notions of data equivalences to be considered. For example, Varshney & Goyal (DCC, 2006) considered multiset equivalences, while Choi & Szpankowski (IEE ..."
Abstract
 Add to MetaCart
(IEEE Trans. IT, 2012) considered isomorphic equivalences in graphs. Here equivalences are considered under a relatively broad framework finitedimensional, nonsequential data spaces with equivalences under group action, for which analogues of two wellstudied embedding theorems are derived
Analysis of methods for extraction of
, 2011
"... Analysis of methods for extraction of programs from nonconstructive proofs Dissertation an der Fakultät für Mathematik, Informatik und Statistik der ..."
Abstract
 Add to MetaCart
Analysis of methods for extraction of programs from nonconstructive proofs Dissertation an der Fakultät für Mathematik, Informatik und Statistik der
Arbitrarily accurate approximate inertial manifolds of fixed dimension
 Phys. Lett. A
, 1997
"... ABSTRACT: By employing an embedding result due to Mañé, and its recent strengthening due to Foias & Olson it is shown that a global attractor with finite fractal (box counting) dimension d lies within an arbitrarily small neighbourhood of a smooth graph over the space spanned by the first [[2d+1 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
ABSTRACT: By employing an embedding result due to Mañé, and its recent strengthening due to Foias & Olson it is shown that a global attractor with finite fractal (box counting) dimension d lies within an arbitrarily small neighbourhood of a smooth graph over the space spanned by the first [[2d
Results 1  10
of
632