Results 1  10
of
1,276
THE STABLE EMBEDDING PROBLEM
"... Abstract: We compute a stable polynomial matrix embedding a stabilizable one. The algorithm resembles the one described by Beelen and Van Dooren for the unimodular embedding problem. We also desribe the numerical problems associated with this kind of algorithms, and point out why the stable embeddin ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract: We compute a stable polynomial matrix embedding a stabilizable one. The algorithm resembles the one described by Beelen and Van Dooren for the unimodular embedding problem. We also desribe the numerical problems associated with this kind of algorithms, and point out why the stable
Localitysensitive hashing scheme based on pstable distributions
 In SCG ’04: Proceedings of the twentieth annual symposium on Computational geometry
, 2004
"... inÇÐÓ�Ò We present a novel LocalitySensitive Hashing scheme for the Approximate Nearest Neighbor Problem underÐÔnorm, based onÔstable distributions. Our scheme improves the running time of the earlier algorithm for the case of theÐnorm. It also yields the first known provably efficient approximate ..."
Abstract

Cited by 521 (8 self)
 Add to MetaCart
NN algorithm for the caseÔ�. We also show that the algorithm finds the exact near neigbhor time for data satisfying certain “bounded growth ” condition. Unlike earlier schemes, our LSH scheme works directly on points in the Euclidean space without embeddings. Consequently, the resulting query time
STABLE EMBEDDED MINIMAL SURFACES BOUNDED BY A STRAIGHT
"... Abstract. We prove that if M ⊂ R3 is a properly embedded oriented stable minimal surface whose boundary is a straight line and the area of M in extrinsic balls grows quadratically in the radius, thenM is a halfplane or half of the classical Enneper minimal surface. This solves a conjecture posed by ..."
Abstract
 Add to MetaCart
Abstract. We prove that if M ⊂ R3 is a properly embedded oriented stable minimal surface whose boundary is a straight line and the area of M in extrinsic balls grows quadratically in the radius, thenM is a halfplane or half of the classical Enneper minimal surface. This solves a conjecture posed
EXAMPLES OF STABLE EMBEDDED MINIMAL SPHERES WITHOUT AREA BOUNDS
, 812
"... Throughout this paper, we use the C 2topology on the space of metrics on a manifold. The main result will be the following theorem: Theorem 1.1. Let M 3 be a threemanifold. There exists an open, nonempty set of metrics on M for each of which there are stable embedded minimal twospheres of arbitra ..."
Abstract
 Add to MetaCart
Throughout this paper, we use the C 2topology on the space of metrics on a manifold. The main result will be the following theorem: Theorem 1.1. Let M 3 be a threemanifold. There exists an open, nonempty set of metrics on M for each of which there are stable embedded minimal two
Extending and Implementing the Stable Model Semantics
, 2002
"... A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes normal logic programs by allowing weight constraints in place of literals to represent, e.g., cardinality and resource constraints and by providing optimization capabilities ..."
Abstract

Cited by 396 (9 self)
 Add to MetaCart
capabilities. A declarative semantics is developed which extends the stable model semantics of normal programs. The computational complexity of the language is shown to be similar to that of normal programs under the stable model semantics. A simple embedding of general weight constraint rules to a small
Robust Routing for Dynamic Wireless Networks Based on Stable Embeddings
 in Proc. Information Theory and Applications workshop (ITA
, 2007
"... Abstract — Routing packets is a central function of multihop wireless networks. Traditionally, there have been two paradigms for routing, either based on the geographical coordinates of the nodes (geographic routing), or based on the connectivity graph (topologybased routing). The former implicitl ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
induced by channel fading and mobility. This motivates the novel problem of stable embeddings, where the additional goal is to maintain an embedding over time, such that the evolution of the embedding faithfully captures the evolution of the underlying graph itself. This is crucial to limit the control
Robust 1Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
, 2011
"... The Compressive Sensing (CS) framework aims to ease the burden on analogtodigital converters (ADCs) by reducing the sampling rate required to acquire and stably recover sparse signals. Practical ADCs not only sample but also quantize each measurement to a finite number of bits; moreover, there is ..."
Abstract

Cited by 85 (26 self)
 Add to MetaCart
consider reconstruction robustness to measurement errors and noise and introduce the Binary ɛStable Embedding (BɛSE) property, which characterizes the robustness measurement process to sign changes. We show the same class of matrices that provide optimal noiseless performance also enable such a robust
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
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
Cartesian Grid Embedded Boundary Methods for Elliptic and
 Univ. of California, Berkeley
, 1997
"... We present an algorithm for solving the heat equation on irregular timedependent domains. It is based on the Cartesian grid embedded boundary algorithm of Johansen and Colella (1998, J. Comput. Phys. 147, 60) for discretizing Poisson’s equation, combined with a secondorder accurate discretization ..."
Abstract

Cited by 178 (20 self)
 Add to MetaCart
We present an algorithm for solving the heat equation on irregular timedependent domains. It is based on the Cartesian grid embedded boundary algorithm of Johansen and Colella (1998, J. Comput. Phys. 147, 60) for discretizing Poisson’s equation, combined with a secondorder accurate discretization
Results 1  10
of
1,276