Results 1  10
of
103
On dregular schematization of embedded paths
 Computational Geometry: Theory and Applications
, 2014
"... Abstract. In the dregular path schematization problem we are given an embedded path P (e.g., a route in a road network) and an integer d. The goal is to find a dschematized embedding of P in which the orthogonal order of all vertices in the input is preserved and in which every edge has a slope t ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. In the dregular path schematization problem we are given an embedded path P (e.g., a route in a road network) and an integer d. The goal is to find a dschematized embedding of P in which the orthogonal order of all vertices in the input is preserved and in which every edge has a slope
Path schematization for route sketches
 In Algorithm Theory  SWAT 2010, volume 6139 of LNCS
, 2010
"... Abstract. Motivated from drawing route sketches, we consider the following problem. We are given a simple embedded polygonal path P = (v1,..., vn), consisting of k x or ymonotone subpaths, and a set C of admissible edge orientations including the coordinate axes. The problem is to redraw P schemat ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. Motivated from drawing route sketches, we consider the following problem. We are given a simple embedded polygonal path P = (v1,..., vn), consisting of k x or ymonotone subpaths, and a set C of admissible edge orientations including the coordinate axes. The problem is to redraw P
Graph Augmentation via Metric Embedding
"... Abstract. Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between any pair of nodes in a graph, with only a partial knowledge of distances. Following this seminal work, a major ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
shortest paths metric admits an embedding of distorsion γ into R d can be augmented by one link per node such that greedy routing computes paths of expected length O ( 1 ε γd log 2+ε n) between any pair of nodes with the only knowledge of G. Ourmethod isolates all the structural constraints
NOTE ON PETRIE DUALS AND HYPERCUBE EMBEDDINGS OF SEMIREGULAR POLYHEDRA
"... A nonPlatonic convex polyhedron in R 3 is semiregular if it is vertextransitive and its faces are regular polygons. The semiregular polyhedra consist of the 13 Archimedean solids and two infinite families of nsided prisms Prismn and antiprisms APrismn. The skeleton graphs (verticesedges) G(M) of ..."
Abstract
 Add to MetaCart
, of the pathmetric of the graph G(M). In this Note, an hypercube embedding of a map M means that 2d (doubled pathmetric of its skeleton G(M)) isometrically embeds into the pathmetric of some halfcube 1 2 Hm. Isometric embedding of d in the pathmetric of some hypercube Hm implies isometric embedding of 2d
Achieving RangeFree Localization Beyond Connectivity
"... Wireless sensor networks have been proposed for many locationdependent applications. In such applications, the requirement of low system cost prohibitsmany rangebased methods for sensor node localization; on the other hand, rangefree localization depending only on connectivity may underutilize th ..."
Abstract

Cited by 38 (5 self)
 Add to MetaCart
knownlocalizationalgorithmsandtesteditintwotypes ofoutdoortestbedexperiments: an850footlonglinearnetwork with 54 MICAz motes, and a regular2D networkcovering an area of 10000 square feet with 49 motes. Results show that our design helps eliminate estimation ambiguity with subhop resolution, and reduces localization errors by as much as 35%. In addition
Generalized Mehler semigroups and applications
, 1994
"... We construct and study generalized Mehler semigroups (p t ) t#0 and their associated Markov processes M. The construction methods for (p t ) t#0 are based on some new purely functional analytic results implying, in particular, that any strongly continuous semigroup on a Hilbert space H can be extend ..."
Abstract

Cited by 26 (5 self)
 Add to MetaCart
chosen larger space E. For Gaussian generalized Mehler semigroups (p t ) t#0 with corresponding Markov process M, the associated (nonsymmetric) Dirichlet forms (E , D(E)) are explicitly calculated and a necessary and sufficient condition for path regularity of M in terms of (E , D(E)) is proved. Then
Homotopic rectilinear routing with few links and thick edges
 Proc. LATIN 2010, volume 6034 of Lecture Notes Comput. Sci
, 2010
"... We study the problem of finding noncrossing thick minimumlink rectilinear paths homotopic to a set of input paths in an environment with rectangular obstacles. This problem occurs in the context of map schematization under geometric embedding restrictions, for example, when schematizing a highwa ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We study the problem of finding noncrossing thick minimumlink rectilinear paths homotopic to a set of input paths in an environment with rectangular obstacles. This problem occurs in the context of map schematization under geometric embedding restrictions, for example, when schematizing a high
Collapsing threemanifolds under a lower curvature bound
 J. Differential Geom
"... Abstract The purpose of this paper is to completely characterize the topology of threedimensional Riemannian manifolds with a uniform lower bound of sectional curvature which converges to a metric space of lower dimension. Introduction We study the topology of threedimensional Riemannian manifolds ..."
Abstract

Cited by 30 (3 self)
 Add to MetaCart
be a path in Mö cutting Mö open to a disk. Let S be the part of M over γ, which is homeomorphic to S 2 . Note that M − S is connected. Then by a similar argument, we can conclude that M S 2 × S 1 . The rest of the inductive argument follows in the same way. q.e.d. Proof. This follows from Theorem 0
From motion to colocation: Source/goal ambiguity in Southeastern Pomo
, 2008
"... • Motion and location are characterized by (at least) an imageschematic frame and temporal profiling. • For motionrelated events, the central schema is sourcepathgoal (SPG). • Some static situations, such as those involving endstate focus, may evoke schemas normally related only to motion event ..."
Abstract
 Add to MetaCart
• Motion and location are characterized by (at least) an imageschematic frame and temporal profiling. • For motionrelated events, the central schema is sourcepathgoal (SPG). • Some static situations, such as those involving endstate focus, may evoke schemas normally related only to motion
Published online XXXX
"... We investigate exciton boundstate formation and crystallization effects in twodimensional electronhole bilayers. Performing unbiased path integral Monte Carlo simulations all quantum and Coulomb correlation effects are treated on first principles. We analyze diverse pair distribution functions i ..."
Abstract
 Add to MetaCart
We investigate exciton boundstate formation and crystallization effects in twodimensional electronhole bilayers. Performing unbiased path integral Monte Carlo simulations all quantum and Coulomb correlation effects are treated on first principles. We analyze diverse pair distribution functions
Results 1  10
of
103