'Massive data algorithmics' diaporamas de présentation

Energy-Efficient Sorting using Solid State Disks

94 views • 1 slides

Cell Probe Lower Bounds and Approximations for Range Mode

Jakob Truelsen Aarhus University. Mark Greve Aarhus University. Cell Probe Lower Bounds and Approximations for Range Mode. i. j. A.

94 views • 1 slides

Cleaning Sonar Terrain Data

Freek van Walderveen Aarhus University. Cleaning Sonar Terrain Data. Blue: reconstructed surface. Green: points removed by both manual cleaning and our algorithm. Red: points kept during manual cleaning, but removed by our algorithm.

93 views • 1 slides

Accelerating Dynamic Programming

134 views • 1 slides

Elad Verbin Aarhus University

199 views • 1 slides

Scalable Top- k Spatio-Temporal Term Querying

270 views • 1 slides

Provably Efficient GPU Algorithms

Nodari Sitchinava KIT. Volker Weichert Goethe University. Provably Efficient GPU Algorithms. Block 0. Block B-1. Warp 0. Warp 0. Warp 1. Warp 1. Warp C-1. Warp C-1. Block 0. Block C-1. Threads. Threads. Shared memory. Shared memory. Global Memory. CPU. Kernel 0. Kernel 1.

187 views • 1 slides

TerraSTREAM : Terrain Processing Pipeline

97 views • 1 slides

Geometric Range Searching

93 views • 1 slides

Simplification of Planar Decomposition

Jakob Truelsen Aarhus University. Jungwoo Yang Aarhus University. Simplification of Planar Decomposition. External memory algorithm. Simp lify line strings containing only nodes of degree two. The weight of a face is the number of segments on it.

69 views • 1 slides

Improved Analysis of the Average-Case Behavior of Classic Single-Source Shortest Path Approaches

Andrei Negoescu Goethe University. Ulrich Meyer Goethe University. Volker Weichert Goethe University. Improved Analysis of the Average-Case Behavior of Classic Single-Source Shortest Path Approaches.

88 views • 1 slides

Polygonal Line Simplification

129 views • 1 slides

Height

148 views • 1 slides

Elad Verbin Aarhus University

89 views • 1 slides

TerraSTREAM: Contour Line Generation

128 views • 1 slides

Soft memory errors Random bit flips, corrupting the content of the affected memory cells

Gabriel Moruz Goethe University. Resilient k-d Trees: k -Means in Space. Soft memory errors Random bit flips, corrupting the content of the affected memory cells Multiple causes, e.g. power failures, alpha particles, cosmic rays Memories tend to be more error-prone

96 views • 1 slides

Orthogonal Range Reporting: Optimal 3-d Structures and Query Lower Bounds

Kasper Green Larsen Aarhus University. Q( d +1, k +1). Orthogonal Range Reporting: Optimal 3-d Structures and Query Lower Bounds. Q( d +1, k ). Q( d +1, k ). Q( d , k ). Q( d , k ). employee. salary 8000. p ={ }. C ={ } P ={ , , , }.

93 views • 1 slides

I/O-efficient Approximate Distance Oracle for Real-world Graphs

Deepak Ajwani Bell Labs, Ireland. Ulrich Meyer Goethe University. David Veith Goethe University. I/O-efficient Approximate Distance Oracle for Real-world Graphs.

147 views • 1 slides

Mohammad Abam University of Aarhus

t. t. t. Mohammad Abam University of Aarhus. Kinetic Data Structures. c. a. d. b. Certificates a is to the left of b c d is to the left of b c b is to the right of a d c is to the left of a d. first event in global queue. Set of valid Certificates. Certificate Failure.

77 views • 1 slides