Pages that link to "Item:Q2484030"
From MaRDI portal
The following pages link to Outlier detection under interval uncertainty: algorithmic solvability and computational complexity (Q2484030):
Displaying 5 items.
- Towards combining probabilistic and interval uncertainty in engineering calculations: algorithms for computing statistics under interval uncertainty, and their computational complexity (Q854767) (← links)
- The complexity of computation and approximation of the \(t\)-ratio over one-dimensional interval data (Q1623689) (← links)
- Computing population variance and entropy under interval uncertainty: Linear-time algorithms (Q2481140) (← links)
- Computing mean and variance under Dempster-Shafer uncertainty: towards faster algorithms (Q2506950) (← links)
- Should data ever be thrown away? Pooling interval-censored data sets with different precision (Q6114035) (← links)
