Pages that link to "Item:Q3753527"
From MaRDI portal
The following pages link to Filtering Search: A New Approach to Query-Answering (Q3753527):
Displaying 50 items.
- Linear-space data structures for range frequency queries on arrays and trees (Q261369) (← links)
- Entropy-bounded representation of point grids (Q390358) (← links)
- Worst-case efficient single and multiple string matching on packed texts in the word-RAM model (Q450552) (← links)
- Linear-space data structures for range minority query in arrays (Q494786) (← links)
- Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings (Q507391) (← links)
- Substring range reporting (Q517792) (← links)
- Computing hereditary convex structures (Q540446) (← links)
- Linear space data structures for two types of range search (Q578916) (← links)
- Graph problems arising from parameter identification of discrete dynamical systems (Q634788) (← links)
- The intersection searching problem for c-oriented polygons (Q751326) (← links)
- Optimal external memory planar point enclosure (Q834582) (← links)
- Range queries on uncertain data (Q897858) (← links)
- Visibility and intersection problems in plane geometry (Q910213) (← links)
- Efficient dynamic algorithms for some geometric intersection problems (Q918702) (← links)
- Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines (Q1041794) (← links)
- Computing convolutions by reciprocal search (Q1091816) (← links)
- The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric (Q1093374) (← links)
- A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency (Q1115624) (← links)
- Making data structures persistent (Q1117690) (← links)
- A framework for 1-D compaction with forbidden region avoidance (Q1194311) (← links)
- Parallel fractional cascading on hypercube multiprocessors (Q1196294) (← links)
- Reporting points in halfspaces (Q1196295) (← links)
- Orthogonal queries in segments (Q1355726) (← links)
- Dynamic orthogonal range queries in OLAP. (Q1401285) (← links)
- Efficient searching with linear constraints (Q1591152) (← links)
- The new \(k\)-windows algorithm for improving the \(k\)-means clustering algorithm (Q1599210) (← links)
- Dictionary matching with a bounded gap in pattern or in text (Q1709592) (← links)
- Optimal deterministic shallow cuttings for 3-d dominance ranges (Q1755735) (← links)
- Finding pairwise intersections inside a query range (Q1755743) (← links)
- A new framework for addressing temporal range queries and some preliminary results (Q1770382) (← links)
- Extending range queries and nearest neighbors (Q1841241) (← links)
- An algorithm for handling many relational calculus queries efficiently. (Q1872707) (← links)
- Lower bounds for intersection searching and fractional cascading in higher dimension (Q1887711) (← links)
- A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids (Q1894952) (← links)
- Simplex range reporting on a pointer machine (Q1917035) (← links)
- Algorithms for generalized halfspace range searching and other intersection searching problems (Q1917041) (← links)
- Finding pairwise intersections of rectangles in a query rectangle (Q2175440) (← links)
- String indexing for patterns with wildcards (Q2254487) (← links)
- Join-reachability problems in directed graphs (Q2254502) (← links)
- Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
- Biased range trees (Q2428657) (← links)
- Space efficient dynamic orthogonal range reporting (Q2461544) (← links)
- On the difficulty of range searching. (Q2482904) (← links)
- Algorithms for three-dimensional dominance searching in linear space. (Q2583568) (← links)
- OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM (Q2708039) (← links)
- IMPROVED POINTER MACHINE AND I/O LOWER BOUNDS FOR SIMPLEX RANGE REPORTING AND RELATED PROBLEMS (Q2875643) (← links)
- DATA STRUCTURES FOR RANGE-AGGREGATION OVER CATEGORIES (Q2909107) (← links)
- Dictionary Matching with Uneven Gaps (Q2942261) (← links)
- Aggregate-MAX Top-<i>k</i> Nearest Neighbor Searching in the <i>L</i><sub>1</sub> Plane (Q2950594) (← links)
- Worst Case Efficient Single and Multiple String Matching in the RAM Model (Q3000497) (← links)
