Results 1  10
of
498,488
Numerical solution of initial boundary value problems involving Maxwell’s equations in isotropic media
 IEEE Trans. Antennas and Propagation
, 1966
"... The characteristics of the waves guided along a plane [I] P. S. Epstein, “On the possibility of electromagnetic surface waves, ” Proc. Nat’l dcad. Sciences, vol. 40, pp. 11581165, Deinterface which separates a semiinfinite region of free cember 1954. space from that of a magnetoionic medium are in ..."
Abstract

Cited by 1055 (0 self)
 Add to MetaCart
The characteristics of the waves guided along a plane [I] P. S. Epstein, “On the possibility of electromagnetic surface waves, ” Proc. Nat’l dcad. Sciences, vol. 40, pp. 11581165, Deinterface which separates a semiinfinite region of free cember 1954. space from that of a magnetoionic medium
Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams
 ACM Tmns. Graph
, 1985
"... The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms ar ..."
Abstract

Cited by 534 (11 self)
 Add to MetaCart
are given, one that constructs the Voronoi diagram in O(n log n) time, and another that inserts a new site in O(n) time. Both are based on the use of the Voronoi dual, or Delaunay triangulation, and are simple enough to be of practical value. The simplicity of both algorithms can be attributed
Applications of Random Sampling in Computational Geometry, II
 Discrete Comput. Geom
, 1995
"... We use random sampling for several new geometric algorithms. The algorithms are "Las Vegas," and their expected bounds are with respect to the random behavior of the algorithms. These algorithms follow from new general results giving sharp bounds for the use of random subsets in geometric ..."
Abstract

Cited by 432 (12 self)
 Add to MetaCart
algorithms. These bounds show that random subsets can be used optimally for divideandconquer, and also give bounds for a simple, general technique for building geometric structures incrementally. One new algorithm reports all the intersecting pairs of a set of line segments in the plane, and requires O(A
ON MAP PROJECTIONS FOR NUMERICAL WEATHER PREDICTION
, 1973
"... Standard meteorological texts usually discuss the equations governing the atmosphere in either spherical coordinates or ona $plane. In the practice of numerical weather prediction, the equations are usually transformed into the map coordinates of a conformal map. This note is an attempt to bring t ..."
Abstract
 Add to MetaCart
Standard meteorological texts usually discuss the equations governing the atmosphere in either spherical coordinates or ona $plane. In the practice of numerical weather prediction, the equations are usually transformed into the map coordinates of a conformal map. This note is an attempt to bring
Localization from Mere Connectivity
 In Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
, 2003
"... It is often useful to know the geographic positions of nodes in a communications network, but adding GPS receivers or other sophisticated sensors to every node can be expensive. We present an algorithm that uses connectivity information— who is within communications range of whom—to derive the locat ..."
Abstract

Cited by 367 (9 self)
 Add to MetaCart
the locations of the nodes in the network. The method can take advantage of additional information, such as estimated distances between neighbors or known positions for certain anchor nodes, if it is available. The algorithm is based on multidimensional scaling, a data analysis technique that takes O(n 3) time
Pad  An Alternative Approach to the Computer Interface
 IN PROC. ACM SIGGRAPH
, 1993
"... We believe that navigation in information spaces is best supported by tapping into our natural spatial and geographic ways of thinking. To this end, we are developing a new computer interface model called Pad. The ongoing Pad project uses a spatial metaphor for computer interface design. It provides ..."
Abstract

Cited by 333 (2 self)
 Add to MetaCart
. It provides an intuitive base for the support of such applications as electronic marketplaces, information services, and online collaboration. Pad is an infinite twodimensional information plane that is shared among users, much as a network file system is shared. Objects are organized geographically; every
Approximation Algorithms for Projective Clustering
 Proceedings of the ACM SIGMOD International Conference on Management of data, Philadelphia
, 2000
"... We consider the following two instances of the projective clustering problem: Given a set S of n points in R d and an integer k ? 0; cover S by k hyperstrips (resp. hypercylinders) so that the maximum width of a hyperstrip (resp., the maximum diameter of a hypercylinder) is minimized. Let w ..."
Abstract

Cited by 305 (22 self)
 Add to MetaCart
results related to projective clustering: (i) For d = 2, we present a randomized algorithm that computes O(k log k) strips of width at most 6w that cover S. Its expected running time is O(nk 2 log 4 n) if k 2 log k n; it also works for larger values of k, but then the expected running time is O(n
ona a, P
"... cienc A disordered Ni25at.%V alloy undergoes a cubic (A1) to tetragonal (DO22) ordering transformation at temperatures below 1045 C by a firstorder transformation process. This transformation leads to the ..."
Abstract
 Add to MetaCart
cienc A disordered Ni25at.%V alloy undergoes a cubic (A1) to tetragonal (DO22) ordering transformation at temperatures below 1045 C by a firstorder transformation process. This transformation leads to the
Active Networking OnA Programmable Networking Platform
 In OPENARCH 2001. 2001 IEEE Fourth Conference on, pages 98 – 107
, 2001
"... Current Active Networks research projects are mainly realized in softwarebased host systems since commercial network devices lack required networking programmability. This paper studies the active networking approach using the Openet programmable networking platform. Openet comprises ORE (Oplet Run ..."
Abstract
 Add to MetaCart
Runtime Environment) and hierarchical services from lowlevel systems to highlevel applications, and provides a neutral servicebased programmability to network devices. Moreover, Openet can have customer network services including Active Networksbased services deployed on current commercial network
An optimal algorithm for intersecting line segments in the plane
 J. ACM
, 1992
"... The main contribution of this work is an O(n log r ~ +k)time algorithm focomputinall k intersections among n line segments in the plane, This time complexity IS easily shown to be optimal. Within the same asymptotic cost, our algorithm can also construct the subdiwslon of the plancdefmed by the s ..."
Abstract

Cited by 176 (2 self)
 Add to MetaCart
The main contribution of this work is an O(n log r ~ +k)time algorithm focomputinall k intersections among n line segments in the plane, This time complexity IS easily shown to be optimal. Within the same asymptotic cost, our algorithm can also construct the subdiwslon of the plancdefmed
Results 1  10
of
498,488