Results 1  10
of
4,696,872
Small weak epsilonnets
, 2008
"... Given a set P of points in the plane, a set of points Q is a weak εnet with respect to a family of sets S (e.g., rectangles, disks, or convex sets) if every set of S containing εP  points contains a point of Q. In this paper, we determine bounds on εS i, the smallest epsilon that can be guarante ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Given a set P of points in the plane, a set of points Q is a weak εnet with respect to a family of sets S (e.g., rectangles, disks, or convex sets) if every set of S containing εP  points contains a point of Q. In this paper, we determine bounds on εS i, the smallest epsilon that can
Small weak epsilonnets in three dimensions
 In Proceedings of the 18th Canadian Conference on Computational Geometry
, 2006
"... We study the problem of finding small weak εnets in three dimensions and provide new upper and lower bounds on the value of ε for which a weak εnet of a given small constant size exists. The range spaces under consideration are the set of all convex sets and the set of all halfspaces in R3. 1 ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We study the problem of finding small weak εnets in three dimensions and provide new upper and lower bounds on the value of ε for which a weak εnet of a given small constant size exists. The range spaces under consideration are the set of all convex sets and the set of all halfspaces in R3. 1
Small Weak EpsilonNets in Three Dimensions
"... We study the problem of finding small weak εnets in three dimensions and provide new upper and lower bounds on the value of ε for which a weak εnet of a given small constant size exists. The range spaces under consideration are the set of all convex sets and the set of all halfspaces in R 3. 1 ..."
Abstract
 Add to MetaCart
We study the problem of finding small weak εnets in three dimensions and provide new upper and lower bounds on the value of ε for which a weak εnet of a given small constant size exists. The range spaces under consideration are the set of all convex sets and the set of all halfspaces in R 3. 1
Lower bounds for weak epsilonnets and stairconvexity
 IN: PROC. 25TH ACM SYMPOS. COMPUT. GEOM. (SOCG 2009
, 2009
"... A set N ⊂ Rd is called a weak εnet (with respect to convex sets) for a finite X ⊂ Rd if N intersects every convex set C with X ∩ C  ≥ εX. For every fixed d ≥ 2 and every r ≥ 1 we construct sets X ⊂ Rd for which every weak 1 rnet has at least Ω(r logd−1 r) points; this is the first superlinear ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
A set N ⊂ Rd is called a weak εnet (with respect to convex sets) for a finite X ⊂ Rd if N intersects every convex set C with X ∩ C  ≥ εX. For every fixed d ≥ 2 and every r ≥ 1 we construct sets X ⊂ Rd for which every weak 1 rnet has at least Ω(r logd−1 r) points; this is the first
On limits of wireless communications in a fading environment when using multiple antennas
 Wireless Personal Communications
, 1998
"... Abstract. This paper is motivated by the need for fundamental understanding of ultimate limits of bandwidth efficient delivery of higher bitrates in digital wireless communications and to also begin to look into how these limits might be approached. We examine exploitation of multielement array (M ..."
Abstract

Cited by 2363 (14 self)
 Add to MetaCart
to the baseline n = 1 case, which by Shannon’s classical formula scales as one more bit/cycle for every 3 dB of signaltonoise ratio (SNR) increase, remarkably with MEAs, the scaling is almost like n more bits/cycle for each 3 dB increase in SNR. To illustrate how great this capacity is, even for small n, take
Efficient Variants of the ICP Algorithm
 INTERNATIONAL CONFERENCE ON 3D DIGITAL IMAGING AND MODELING
, 2001
"... The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of threedimensional models when an initial estimate of the relative pose is known. Many variants of ICP have been proposed, affecting all phases of the algorithm from the selection and matching of points to the minim ..."
Abstract

Cited by 702 (5 self)
 Add to MetaCart
The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of threedimensional models when an initial estimate of the relative pose is known. Many variants of ICP have been proposed, affecting all phases of the algorithm from the selection and matching of points
Bayesian Data Analysis
, 1995
"... I actually own a copy of Harold Jeffreys’s Theory of Probability but have only read small bits of it, most recently over a decade ago to confirm that, indeed, Jeffreys was not too proud to use a classical chisquared pvalue when he wanted to check the misfit of a model to data (Gelman, Meng and Ste ..."
Abstract

Cited by 2132 (59 self)
 Add to MetaCart
I actually own a copy of Harold Jeffreys’s Theory of Probability but have only read small bits of it, most recently over a decade ago to confirm that, indeed, Jeffreys was not too proud to use a classical chisquared pvalue when he wanted to check the misfit of a model to data (Gelman, Meng
Rho GTPases and the actin cytoskeleton
 Science
, 1998
"... The actin cytoskeleton mediates a variety of essential biological functions in all eukaryotic cells. In addition to providing a structural framework around which cell shape and polarity are defined, its dynamic properties provide the driving force for cells to move and to divide. Understanding the b ..."
Abstract

Cited by 589 (4 self)
 Add to MetaCart
the biochemical mechanisms that control the organization of actin is thus a major goal of contemporary cell biology, with implications for health and disease. Members of the Rho family of small guanosine triphosphatases have emerged as key regulators of the actin cytoskeleton, and furthermore, through
Results 1  10
of
4,696,872