The following pages link to (Q4947407):
Displayed 50 items.
- Transforming pseudo-triangulations (Q2390240) (← links)
- Prophet: a context-aware location privacy-preserving scheme in location sharing service (Q2398789) (← links)
- Nearest-neighbor searching under uncertainty. I (Q2411831) (← links)
- Mind the gap! (Q2414857) (← links)
- A mathematical framework for modeling axon guidance (Q2426223) (← links)
- Biased range trees (Q2428657) (← links)
- An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs (Q2429326) (← links)
- Computing homotopic shortest paths efficiently (Q2432731) (← links)
- Algorithms for optimal area triangulations of a convex polygon (Q2432732) (← links)
- A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem (Q2432914) (← links)
- Dynamic 3-sided planar range queries with expected doubly-logarithmic time (Q2437762) (← links)
- A note on minimum-sum coverage by aligned disks (Q2445326) (← links)
- On reporting the \(L_1\) metric closest pair in a query rectangle (Q2446069) (← links)
- Extracting constrained 2-interval subsets in 2-interval sets (Q2456375) (← links)
- The generic Gröbner walk (Q2457423) (← links)
- A tight lower bound for computing the diameter of a 3D convex polytope (Q2461545) (← links)
- On local transformations in plane geometric graphs embedded on small grids (Q2462732) (← links)
- Query point visibility computation in polygons with holes (Q2462733) (← links)
- Lower bounds for expected-case planar point location (Q2462734) (← links)
- An optimal algorithm for the minimum disc cover problem (Q2471803) (← links)
- Adaptive sampling for geometric problems over data streams (Q2477195) (← links)
- Improved approximation bounds for planar point pattern matching (Q2480906) (← links)
- Improved output-sensitive snap rounding (Q2482192) (← links)
- Sweep synchronization as a global propagation mechanism (Q2489125) (← links)
- Aggregation for the probabilistic traveling salesman problem (Q2489311) (← links)
- A variational meshfree method for solving time-discrete diffusion equations (Q2491643) (← links)
- A sweep-line algorithm for the inclusion hierarchy among circles (Q2493494) (← links)
- Planar graphs, negative weight edges, shortest paths, and near linear time (Q2496320) (← links)
- Fast multiscale clustering and manifold identification (Q2498680) (← links)
- Parallelization alternatives and their performance for the convex hull problem (Q2504444) (← links)
- Total least squares fitting of \(k\)-spheres in \(n\)-D Euclidean space using an \((n+2)\)-D isometric representation (Q2513426) (← links)
- Calculating the vertex unknowns of nine point scheme on quadrilateral meshes for diffusion equation (Q2519315) (← links)
- Crossing patterns of semi-algebraic sets (Q2566809) (← links)
- Adaptive finite difference methods for nonlinear elliptic and parabolic partial differential equations with free boundaries (Q2631051) (← links)
- Fuzzy distance-based range queries over uncertain moving objects (Q2637277) (← links)
- Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problems (Q2638378) (← links)
- A symmetry based multiobjective clustering technique for automatic evolution of clusters (Q2654238) (← links)
- The typical cell of a Voronoi tessellation on the sphere (Q2665262) (← links)
- The pairwise flowtime network construction problem (Q2670455) (← links)
- A hybrid inference system for improved curvature estimation in the level-set method using machine learning (Q2671404) (← links)
- Error-correcting neural networks for two-dimensional curvature computation in the level-set method (Q2674272) (← links)
- Rectangular partitions of a rectilinear polygon (Q2678268) (← links)
- On the parameterized complexity of the Maximum Exposure Problem (Q2680233) (← links)
- Machine learning algorithms for three-dimensional mean-curvature computation in the level-set method (Q2687554) (← links)
- Improved Algorithm for Maximum Independent Set on Unit Disk Graph (Q2795948) (← links)
- Counting Subgraphs in Relational Event Graphs (Q2803823) (← links)
- Computing a Minimum-Width Square or Rectangular Annulus with Outliers (Q2817885) (← links)
- Factorization of cp-rank-3 completely positive matrices (Q2828827) (← links)
- On Some Proximity Problems of Colored Sets (Q2867120) (← links)
- Monte-Carlo Valuation of American Options: Facts and New Algorithms to Improve Existing Methods (Q2917432) (← links)