Results 1  10
of
9,637
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
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
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
Network Time Protocol (Version 3) Specification, Implementation and Analysis
, 1992
"... Note: This document consists of an approximate rendering in ASCII of the PostScript document of the same name. It is provided for convenience and for use in searches, etc. However, most tables, figures, equations and captions have not been rendered and the pagination and section headings are not ava ..."
Abstract

Cited by 522 (18 self)
 Add to MetaCart
Note: This document consists of an approximate rendering in ASCII of the PostScript document of the same name. It is provided for convenience and for use in searches, etc. However, most tables, figures, equations and captions have not been rendered and the pagination and section headings
Hardness of discrepancy computation and epsilonnet verification in high dimension
 CoRR
"... Discrepancy measures how uniformly distributed a point set is with respect to a given set of ranges. There are two notions of discrepancy, namely continuous discrepancy and combinatorial discrepancy. Depending on the ranges, several possible variants arise, for example star discrepancy, box discrepa ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
parameter, the results moreover imply that these problems require nΩ(d) time, unless 3Sat can be solved in 2o(n) time. Further, we derive that testing whether a given set is an εnet with respect to halfspaces takes nΩ(d) time under the same assumption. As intermediate results, we discover the W[1
A Lower Bound for Weak EpsilonNets in High Dimension
"... A finite set N ae R d is a weak "net for an npoint set X ae R d (with respect to convex sets) if it intersects each convex set K with jK " X j "n. It is shown that there are point sets X ae R d for which every weak 1 50 net has at least const \Delta e p d=2 points. Wea ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A finite set N ae R d is a weak "net for an npoint set X ae R d (with respect to convex sets) if it intersects each convex set K with jK " X j "n. It is shown that there are point sets X ae R d for which every weak 1 50 net has at least const \Delta e p d=2 points
ModelDriven Data Acquisition in Sensor Networks
 IN VLDB
, 2004
"... Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" is problematic, however, because sensors do not exhaustively represent the data in the real world. In order to map the raw sensor ..."
Abstract

Cited by 443 (36 self)
 Add to MetaCart
approximations with probabilistic confidences, significantly more efficient to compute in both time and energy. Utilizing the combination of a model and live data acquisition raises the challenging optimization problem of selecting the best sensor readings to acquire, balancing the increase in the confidence
Results 1  10
of
9,637