Results 1  10
of
2,823
ON A PROBLEM ON EXPLICIT EMBEDDINGS OF THE GROUP Q
, 2005
"... Answering a question of de la Harpe and Bridson in the Kourovka Notebook, we build the explicit embeddings of the additive group of rational numbers Q in a finitely generated group G. ThegroupG in fact is twogenerator, and the constructed embedding can be subnormal and preserve a few properties suc ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Answering a question of de la Harpe and Bridson in the Kourovka Notebook, we build the explicit embeddings of the additive group of rational numbers Q in a finitely generated group G. ThegroupG in fact is twogenerator, and the constructed embedding can be subnormal and preserve a few properties
Explicit Embeddings Basics about Kernels String Kernels
"... Application to Shape Recognition Application to chemoinformatics Conclusion ..."
Abstract
 Add to MetaCart
Application to Shape Recognition Application to chemoinformatics Conclusion
Laplacian eigenmaps and spectral techniques for embedding and clustering.
 Proceeding of Neural Information Processing Systems,
, 2001
"... Abstract Drawing on the correspondence between the graph Laplacian, the LaplaceBeltrami op erator on a manifold , and the connections to the heat equation , we propose a geometrically motivated algorithm for constructing a representation for data sampled from a low dimensional manifold embedded in ..."
Abstract

Cited by 668 (7 self)
 Add to MetaCart
of t he same object is the number of degrees of freedom of the camera in fact the space has the natural structure of a manifold embedded in rn: n2 . While there is a large body of work on dimensionality reduction in general, most existing approaches do not explicitly take into account the structure
High performance scalable image compression with EBCOT
 IEEE Trans. Image Processing
, 2000
"... A new image compression algorithm is proposed, based on independent Embedded Block Coding with Optimized Truncation of the embedded bitstreams (EBCOT). The algorithm exhibits stateoftheart compression performance while producing a bitstream with a rich feature set, including resolution and SNR ..."
Abstract

Cited by 586 (11 self)
 Add to MetaCart
A new image compression algorithm is proposed, based on independent Embedded Block Coding with Optimized Truncation of the embedded bitstreams (EBCOT). The algorithm exhibits stateoftheart compression performance while producing a bitstream with a rich feature set, including resolution and SNR
Uncertainty Principles, Extractors, and ExplicitEmbeddings of L2 into L1
"... ABSTRACT We give an explicit construction of a constant distortion embedding F of ln2 into lm1, with m = n1+o(1). As a bonus, our embedding also has good computational properties: for any input x, F x can be computed in n1+o(1) time. The previously known mappings required \Omega (n2) evaluation time ..."
Abstract
 Add to MetaCart
ABSTRACT We give an explicit construction of a constant distortion embedding F of ln2 into lm1, with m = n1+o(1). As a bonus, our embedding also has good computational properties: for any input x, F x can be computed in n1+o(1) time. The previously known mappings required \Omega (n2) evaluation
A theory of timed automata
, 1999
"... Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of ..."
Abstract

Cited by 2651 (32 self)
 Add to MetaCart
Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis
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
The Use of Explicit Plans to Guide Inductive Proofs
 9TH CONFERENCE ON AUTOMATED DEDUCTION
, 1988
"... We propose the use of explicit proof plans to guide the search for a proof in automatic theorem proving. By representing proof plans as the specifications of LCFlike tactics, [Gordon et al 79], and by recording these specifications in a sorted metalogic, we are able to reason about the conjectures ..."
Abstract

Cited by 295 (40 self)
 Add to MetaCart
We propose the use of explicit proof plans to guide the search for a proof in automatic theorem proving. By representing proof plans as the specifications of LCFlike tactics, [Gordon et al 79], and by recording these specifications in a sorted metalogic, we are able to reason about
Results 1  10
of
2,823