The following pages link to (Q5452284):
Displaying 50 items.
- Grid refinement in the construction of Lyapunov functions using radial basis functions (Q258399) (← links)
- Efficient operations on discrete paths (Q265059) (← links)
- A connectivity graph generation approach for Manhattan path calculation in detailed facility layout (Q274980) (← links)
- On the geometric structures with \(n\) points and \(k\) distances (Q277489) (← links)
- Counting carambolas (Q293619) (← links)
- Parallel finite element technique using Gaussian belief propagation (Q314011) (← links)
- On the representation of the search region in multi-objective optimization (Q319674) (← links)
- From proximity to utility: a Voronoi partition of Pareto optima (Q331376) (← links)
- An isogeometric design-through-analysis methodology based on adaptive hierarchical refinement of NURBS, immersed boundary methods, and T-spline CAD surfaces (Q337892) (← links)
- Optimal randomized incremental construction for guaranteed logarithmic planar point location (Q340542) (← links)
- Enabling high-dimensional range queries using \(k\)NN indexing techniques: approaches and empirical results (Q346495) (← links)
- Fitting a Sobolev function to data. III (Q346662) (← links)
- Connecting the dots: semi-analytical and random walk numerical solutions of the diffusion-reaction equation with stochastic initial conditions (Q348899) (← links)
- On inducing polygons and related problems (Q359751) (← links)
- (Approximate) uncertain skylines (Q359874) (← links)
- Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve (Q364848) (← links)
- External-memory multimaps (Q378243) (← links)
- Exploring or reducing noise? A global optimization algorithm in the presence of noise (Q382006) (← links)
- A regularization approach for estimating the type of a plane curve singularity (Q385004) (← links)
- Exact algorithms and APX-hardness results for geometric packing and covering problems (Q390102) (← links)
- Closest pair and the post office problem for stochastic points (Q390124) (← links)
- Reprint of: Memory-constrained algorithms for simple polygons (Q390167) (← links)
- Fast query structures in anisotropic media (Q391227) (← links)
- On an extension of the Sort \& Search method with application to scheduling theory (Q392015) (← links)
- A note on coloring line arrangements (Q405217) (← links)
- A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space (Q407569) (← links)
- Approximation algorithms for free-label maximization (Q419365) (← links)
- Reasoning about visibility (Q420853) (← links)
- Efficient retrieval of approximate palindromes in a run-length encoded string (Q428850) (← links)
- Applying abstract acceleration to (co-)reachability analysis of reactive programs (Q435977) (← links)
- Efficient algorithms for local ranking (Q436589) (← links)
- Designing and proving correct a convex hull algorithm with hypermaps in Coq (Q448980) (← links)
- Selecting radiotherapy dose distributions by means of constrained optimization problems (Q458718) (← links)
- Discontinuous Galerkin methods with nodal and hybrid modal/nodal triangular, quadrilateral, and polygonal elements for nonlinear shallow water flow (Q460840) (← links)
- On the least trimmed squares estimator (Q472475) (← links)
- Balanced partitions of 3-colored geometric sets in the plane (Q479011) (← links)
- A class of piecewise interpolating functions based on barycentric coordinates (Q480373) (← links)
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing (Q489760) (← links)
- Qualitative constraint satisfaction problems: an extended framework with landmarks (Q490417) (← links)
- Leader election and gathering for asynchronous fat robots without common chirality (Q491635) (← links)
- On finding a shortest isothetic path and its monotonicity inside a digital object (Q499711) (← links)
- Group nearest-neighbor queries in the \(L_1\) plane (Q500965) (← links)
- Efficient algorithms for the one-dimensional \(k\)-center problem (Q500977) (← links)
- Quell (Q500997) (← links)
- Secure multiparty computation of solid geometric problems and their applications (Q507770) (← links)
- Recognition and complexity of point visibility graphs (Q512262) (← links)
- Opaque sets (Q517796) (← links)
- Estimation of effective diffusion coefficients of drug delivery devices in a flow-through system (Q521061) (← links)
- Top-\(k\) Manhattan spatial skyline queries (Q522965) (← links)
- Computing the coarseness with strips or boxes (Q526818) (← links)
