The Most Likely Object to be Seen Through a Window
From MaRDI portal
Publication:5149565
Recommendations
Cites work
- (Approximate) uncertain skylines
- Book review of: J. B. Kadane, Principles of uncertainty
- Closest pair and the post office problem for stochastic points
- Computational geometry. Algorithms and applications.
- Counting subgraphs in relational event graphs
- Delaunay triangulation of imprecise points in linear time after preprocessing
- Finding all maximal subsequences with hereditary properties
- Fuzzy And Uncertain Object-Oriented Databases
- Geometric Computations on Indecisive Points
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- On the Most Likely Convex Hull of Uncertain Points
- Priority Search Trees
- Querying Relational Event Graphs Using Colored Range Searching Data Structures
- Range counting coresets for uncertain data
- Range-max queries on uncertain data
- Stochastic minimum spanning trees in Euclidean spaces
- Time windowed data structures for graphs
- Triangulating input-constrained planar point sets
- Two approaches to building time-windowed geometric data structures
- Uncertainty handling and quality assessment in data mining
- Window queries for problems on intersecting objects and maximal points
- Windows into relational events: data structures for contiguous subsequences of edges
Cited in
(2)
This page was built for publication: The Most Likely Object to be Seen Through a Window
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5149565)