The following pages link to (Q4947407):
Displayed 50 items.
- Accelerated Monte Carlo estimation of exceedance probabilities under monotonicity constraints (Q1931811) (← links)
- Comparison of mixed and isoparametric boundary elements in time domain poroelasticity (Q1958160) (← links)
- Approximate range searching: The absolute model (Q2269144) (← links)
- Regression based automatic face annotation for deformable model building (Q2276003) (← links)
- Advanced programming techniques applied to CGAL's arrangement package (Q2371336) (← links)
- Rotation and lighting invariant template matching (Q2373879) (← links)
- Visualization of road geometries based on CADD design standards (Q2379581) (← links)
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums (Q2384604) (← links)
- On incremental rendering of silhouette maps of a polyhedral scene (Q2385692) (← links)
- Minimum weight pseudo-triangulations (Q2385693) (← links)
- Transforming pseudo-triangulations (Q2390240) (← 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)
- 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)
- Calculating the vertex unknowns of nine point scheme on quadrilateral meshes for diffusion equation (Q2519315) (← links)
- Crossing patterns of semi-algebraic sets (Q2566809) (← 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)
- Monte-Carlo Valuation of American Options: Facts and New Algorithms to Improve Existing Methods (Q2917432) (← links)
- Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures (Q3000523) (← links)
- Graphs with Large Obstacle Numbers (Q3057633) (← links)
- Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point (Q3078388) (← links)
- Range-Aggregate Queries Involving Geometric Aggregation Operations (Q3078390) (← links)
- On the Discrete Unit Disk Cover Problem (Q3078392) (← links)
- Optimal Embedding into Star Metrics (Q3183463) (← links)
- Online Square Packing (Q3183464) (← links)
- Streaming Embeddings with Slack (Q3183478) (← links)
- Continuous-Time Moving Network Voronoi Diagram (Q3223928) (← links)
- The two‐median problem on Manhattan meshes (Q3442865) (← links)
- Two-Dimensional Pattern Matching with Combined Scaling and Rotation (Q3506938) (← links)