The following pages link to describes a project that uses (P1463):
Displaying 50 items.
- Modular symbols, Eisenstein series, and congruences (Q262622) (← links)
- On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously (Q262691) (← links)
- Estimation of a delta-contaminated density of a random intensity of Poisson data (Q262693) (← links)
- Testing for jumps in the presence of smooth changes in trends of nonstationary time series (Q262694) (← links)
- Estimating the density of a conditional expectation (Q262700) (← links)
- Program evaluation as a decision problem (Q262724) (← links)
- Nonparametric estimation of time varying parameters under shape restrictions (Q262746) (← links)
- Reconsidering heterogeneity in panel data estimators of the stochastic frontier model (Q262761) (← links)
- Measurement errors and outliers in seasonal unit root testing (Q262804) (← links)
- On leverage in a stochastic volatility model (Q262831) (← links)
- Unified approach to testing functional hypotheses in semiparametric contexts (Q262835) (← links)
- Renormalization-group investigation of a superconducting \(\operatorname{U}(r)\)-phase transition using five loops calculations (Q262840) (← links)
- Box graphs and resolutions I (Q262881) (← links)
- Box graphs and resolutions. II: From Coulomb phases to fiber faces (Q262882) (← links)
- A Voronoi-based heuristic algorithm for locating distribution centers in disasters (Q262891) (← links)
- Combining energy networks (Q262924) (← links)
- A two-stage urban bus stop location model (Q262929) (← links)
- An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem (Q262934) (← links)
- Slepian spatial-spectral concentration on the ball (Q262938) (← links)
- A multiscale sub-linear time Fourier algorithm for noisy data (Q262947) (← links)
- A fast algorithm for manifold learning by posing it as a symmetric diagonally dominant linear system (Q262960) (← links)
- A genuinely stable Lagrange-Galerkin scheme for convection-diffusion problems (Q263064) (← links)
- A blow-up problem for a nonlinear heat equation in the complex plane of time (Q263065) (← links)
- Shape optimization of flow field improving hydrodynamic stability (Q263068) (← links)
- An interpretation of Łukasiewicz's 4-valued modal logic (Q263087) (← links)
- The remarkable simplicity of very high dimensional data: application of model-based clustering (Q263091) (← links)
- Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices (Q263094) (← links)
- Market segmentation using brand strategy research: Bayesian inference with respect to mixtures of log-linear models (Q263097) (← links)
- Unfolding incomplete data: guidelines for unfolding row-conditional rank order data with random missings (Q263100) (← links)
- Incremental tree-based missing data imputation with lexicographic ordering (Q263101) (← links)
- The future of logic: foundation-independence (Q263104) (← links)
- On an inexact trust-region SQP-filter method for constrained nonlinear optimization (Q263150) (← links)
- Active-set prediction for interior point methods using controlled perturbations (Q263153) (← links)
- On the solution of convex bilevel optimization problems (Q263155) (← links)
- Approximated perspective relaxations: a project and lift approach (Q263157) (← links)
- Towards an objective feasibility pump for convex minlps (Q263161) (← links)
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem (Q263164) (← links)
- Numerical enclosures of the optimal cost of the Kantorovitch's mass transportation problem (Q263172) (← links)
- Analysis of multi-objective Kriging-based methods for constrained global optimization (Q263179) (← links)
- A doubly stabilized bundle method for nonsmooth convex optimization (Q263188) (← links)
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189) (← links)
- A second-order method for strongly convex \(\ell _1\)-regularization problems (Q263191) (← links)
- Generalized Gauss inequalities via semidefinite programming (Q263197) (← links)
- Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming (Q263206) (← links)
- Two pairs of families of polyhedral norms versus \(\ell _p\)-norms: proximity and applications in optimization (Q263209) (← links)
- Parallel coordinate descent methods for big data optimization (Q263212) (← links)
- Variable metric random pursuit (Q263217) (← links)
- A search for quantum coin-flipping protocols using optimization techniques (Q263220) (← links)
- Intelligent choice of the number of clusters in \(K\)-means clustering: an experimental study with different cluster spreads (Q263223) (← links)
- Parsimonious classification via generalized linear mixed models (Q263228) (← links)
