The following pages link to (Q5519710):
Displaying 50 items.
- Stability of the tree of shapes to additive noise (Q2061821) (← links)
- A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with \(2\times 2\) submatrices (Q2061866) (← links)
- Graph based twin cost matrices for unbalanced assignment problem with improved ant colony algorithm (Q2063304) (← links)
- A derived isometry theorem for sheaves (Q2064473) (← links)
- Almost mutually best in matching markets: rank gaps and size of the core (Q2068882) (← links)
- Joint optimization of an autoencoder for clustering and embedding (Q2071333) (← links)
- Role detection and prediction in dynamic political networks (Q2072594) (← links)
- Optimizing consolidation processes in hubs: the hub-arrival-departure problem (Q2076886) (← links)
- Learning large \(Q\)-matrix by restricted Boltzmann machines (Q2088924) (← links)
- Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems (Q2089667) (← links)
- Learn from history for online bipartite matching (Q2091114) (← links)
- A review of the use of optimal transport distances for high resolution seismic imaging based on the full waveform (Q2094840) (← links)
- A time-triggered dimension reduction algorithm for the task assignment problem (Q2095343) (← links)
- Minimum structural sensor placement for switched linear time-invariant systems and unknown inputs (Q2097712) (← links)
- Machine learning assisted droplet trajectories extraction in dense emulsions (Q2097969) (← links)
- Computing valuations of the Dieudonné determinants (Q2100059) (← links)
- Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming (Q2103047) (← links)
- Optimal detection of the feature matching map in presence of noise and outliers (Q2106814) (← links)
- An alternate approach to solve two-level priority based assignment problem (Q2114824) (← links)
- A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness (Q2125539) (← links)
- Staffing problems with local network externalities (Q2126216) (← links)
- Improving stateful premise selection with transformers (Q2128800) (← links)
- Development and analysis of a sentence semantics representation model (Q2132072) (← links)
- The assignment problem revisited (Q2136890) (← links)
- mad-GP: automatic differentiation of Gaussian processes for molecules and materials (Q2141365) (← links)
- A multiscale semi-smooth Newton method for optimal transport (Q2144980) (← links)
- Weighted sparse simplex representation: a unified framework for subspace clustering, constrained clustering, and active learning (Q2147403) (← links)
- Near-optimal performance bounds for orthogonal and permutation group synchronization via spectral methods (Q2155796) (← links)
- On approximation algorithm for orthogonal low-rank tensor approximation (Q2159448) (← links)
- Classes of linear programs solvable by coordinate-wise minimization (Q2163850) (← links)
- Priority inheritance with backtracking for iterative multi-agent path finding (Q2163887) (← links)
- A mathematical model of tonal function. I: Voice leadings (Q2165161) (← links)
- Computing the sequence of \(k\)-cardinality assignments (Q2165282) (← links)
- Fast similarity search for graphs by edit distance (Q2174059) (← links)
- Estimation of volatility causality in structural autoregressions with heteroskedasticity using independent component analysis (Q2175635) (← links)
- The median routing problem for simultaneous planning of emergency response and non-emergency jobs (Q2183877) (← links)
- Synchronization problems in computer vision with closed-form solutions (Q2193841) (← links)
- A random effects stochastic block model for joint community detection in multiple networks with applications to neuroimaging (Q2194484) (← links)
- Comparative statics in markets for indivisible goods (Q2201704) (← links)
- Optimal transportation between unequal dimensions (Q2204773) (← links)
- An instance voting approach to feature selection (Q2225171) (← links)
- Exploiting partial correlations in distributionally robust optimization (Q2227536) (← links)
- The stable marriage problem: an interdisciplinary review from the physicist's perspective (Q2231919) (← links)
- Rényi 100, quantitative and qualitative (in)dependence (Q2236653) (← links)
- Solving an integrated scheduling and routing problem with inventory, routing and penalty costs (Q2239995) (← links)
- Finding efficient make-to-order production and batch delivery schedules (Q2242200) (← links)
- An exact method for scheduling a yard crane (Q2256284) (← links)
- Integer programming models for the multidimensional assignment problem with star costs (Q2256320) (← links)
- Truthful unit-demand auctions with budgets revisited (Q2257295) (← links)
- Enriched spatial comparison of clusterings through discovery of deviating subspaces (Q2260921) (← links)
