binaryswipes fast list search on small touchscreens
play

BinarySwipes: Fast List Search on Small Touchscreens Johannes - PowerPoint PPT Presentation

Aug 17, 2022 •25 likes •145 views

BinarySwipes: Fast List Search on Small Touchscreens Johannes Hartmann Maximilian Schirmer Florian Echtler WeLoveApps GmbH, Erfurt Bauhaus-Universitt Weimar <fmorian.echtler@uni-weimar.de> Twitter: @fmoemuc Lists on

  1. BinarySwipes: Fast List Search on Small Touchscreens Johannes Hartmann¹² Maximilian Schirmer¹ Florian Echtler² ¹ WeLoveApps GmbH, Erfurt ² Bauhaus-Universität Weimar <fmorian.echtler@uni-weimar.de> Twitter: @fmoemuc

  2. Lists on tiny screens? Music Navigation Contacts BinarySwipes @ MuC‘19 (2)

  3. MultiFi Grubert et al. CHI 2015 BinarySwipes @ MuC‘19 (3)

  4. https://www.youtube.com/watch?v=bwkgVYQMkEw

  5. Related Work Generalized Search Chittaro and De Marco List Selection Text Entry Interact 2005 Plaumann et al. Dunlop et al. CHI 2014 EA ISWC 2016 Character Pinning Shani et al., CHI 2009 BinarySwipes @ MuC‘19 (5)

  6. BinarySwipes Where‘s Michael? ... BinarySwipes @ MuC‘19 (6)

  8. Evaluation Binary Linear Hybrid BinarySwipes @ MuC‘19 (8)

  9. Results Task Time 100 200 500 BinarySwipes @ MuC‘19 (9)

  10. Results Nasa TLX BinarySwipes @ MuC‘19 (10)

  11. Summary Thank you! BinarySwipes @ MuC‘19 (11)

  12. Statistics BinarySwipes @ MuC‘19 (12)

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

CS 171: Introduction to Computer Science II Binary Search Trees Binary Search Trees

CS 171: Introduction to Computer Science II Binary Search Trees Binary Search Trees

CS 171: Introduction to Computer Science II Binary Search Trees Binary Search Trees Generalized from Linked List. Advantages: Fast to search Fast to insert and delete Fast to insert and delete Recall the search and

602 views • 32 slides
Linear Search int search(int[] list, int target, int n) { for (int i=1; i&lt;=n; i++) if

Linear Search int search(int[] list, int target, int n) { for (int i=1; i&lt;=n; i++) if

Linear Search int search(int[] list, int target, int n) { for (int i=1; i&lt;=n; i++) if (target == list[i]) return i; return -1; } Order of growth for worst case? Lower Bound on Searching an Unordered List Prove we cant do any better

248 views • 11 slides
Sorting Binary search is a huge speedup over sequential search But requires the list be

Sorting Binary search is a huge speedup over sequential search But requires the list be

Sorting Binary search is a huge speedup over sequential search But requires the list be sorted Slight Problem: How do we get a sorted list? CSE 143 Java Maintain the list in sorted order as each word is added Sort the entire

360 views • 6 slides
The Next Generation of IDEC OI Touchscreens Think Automation and beyond Using a Hardwired

The Next Generation of IDEC OI Touchscreens Think Automation and beyond Using a Hardwired

The Next Generation of IDEC OI Touchscreens Think Automation and beyond Using a Hardwired Panel Parts &amp; Installations can be expensive Information is limited Modification is not an easy task Think Automation and beyond

364 views • 35 slides
MA/CSSE 473 Day 28 (and 29?) Optimal Binary Search trees. 1. Optimal linked list order (if we

MA/CSSE 473 Day 28 (and 29?) Optimal Binary Search trees. 1. Optimal linked list order (if we

MA/CSSE 473 Day 28 (and 29?) Optimal Binary Search trees. 1. Optimal linked list order (if we know the probability of search for each item) a. Item x i in list has probability p i . What is expected number of probes for search? b. Example: p 1 =

152 views • 3 slides
List Decoding of Algebraic Codes Peter Beelen, Kristian Brander and Johan S.R. Nielsen DTU

List Decoding of Algebraic Codes Peter Beelen, Kristian Brander and Johan S.R. Nielsen DTU

Contents List decoding of error-correcting codes Fast list decoding of ReedSolomon codes Fast list decoding of certain AG codes List Decoding of Algebraic Codes Peter Beelen, Kristian Brander and Johan S.R. Nielsen DTU Mathematics

1.33k views • 81 slides
Tap n Ghost A Compilation of Novel Attack Techniques against Smartphone Touchscreens Seita

Tap n Ghost A Compilation of Novel Attack Techniques against Smartphone Touchscreens Seita

Tap n Ghost A Compilation of Novel Attack Techniques against Smartphone Touchscreens Seita Maruyama 1 , Satohiro Wakabayashi 1 , Tatsuya Mori 1, 2 1 Waseda University, Japan 2 RIKEN AIP, Japan Tap n Ghost An attack against smartphones

508 views • 30 slides
Ultra-Fast Similarity Search Using Ternary Content

Ultra-Fast Similarity Search Using Ternary Content

Ultra-Fast Similarity Search Using Ternary Content Addressable Memory Yotam Harchol The Hebrew University of Jerusalem, Israel Joint work

588 views • 31 slides
FAST FACTS: Discuss the progression of COVID-19 Explain COVID-19 List CDC

FAST FACTS: Discuss the progression of COVID-19 Explain COVID-19 List CDC

6/15/20 OBJECTIVES FAST FACTS: Discuss the progression of COVID-19 Explain COVID-19 List CDC recommendations COVERING Provide resources to stay updated COVID-19 Presented by Daejahnee Erby, Rebekah Farag, &amp; Destiny Reed,

509 views • 7 slides
Fast Sparsely Synchronized Rhythms in A Small-World Neuronal Network with Inhibitory

Fast Sparsely Synchronized Rhythms in A Small-World Neuronal Network with Inhibitory

Fast Sparsely Synchronized Rhythms in A Small-World Neuronal Network with Inhibitory Spike-Timing-Dependent Plasticity S.-Y. Kim and W. Lim Institute for Computational Neuroscience Daegu National University of Education Fast Spike

97 views • 7 slides
31: Binary Search Trees Chris Wyatt Electrical and Computer Engineering Recall the binary search

31: Binary Search Trees Chris Wyatt Electrical and Computer Engineering Recall the binary search

ECE 2574 Introduction to Data Structures and Algorithms 31: Binary Search Trees Chris Wyatt Electrical and Computer Engineering Recall the binary search algorithm using a sorted list. We can represent the sorted list using a binary tree with

5.15k views • 20 slides
Redis for Fast Data Ingest Agenda Fast Data Ingest and its challenges Redis for Fast

Redis for Fast Data Ingest Agenda Fast Data Ingest and its challenges Redis for Fast

Home of Redis Redis for Fast Data Ingest Agenda Fast Data Ingest and its challenges Redis for Fast Data Ingest Pub/Sub List Sorted Sets as a Time Series Database The Demo Scaling with Redis e Flash 2

435 views • 42 slides
Divide And Conquer Small And Large Instance Small instance. Sort a list that has n &lt;=

Divide And Conquer Small And Large Instance Small instance. Sort a list that has n &lt;=

Divide And Conquer Small And Large Instance Small instance. Sort a list that has n &lt;= 10 elements. Find the minimum of n &lt;= 2 elements. Distinguish between small and large instances. Large instance. Small instances

86 views • 6 slides
Divide And Conquer Small And Large Instance Small instance. Sort a list that has n &lt;=

Divide And Conquer Small And Large Instance Small instance. Sort a list that has n &lt;=

Divide And Conquer Small And Large Instance Small instance. Sort a list that has n &lt;= 10 elements. Find the minimum of n &lt;= 2 elements. Distinguish between small and large instances. Large instance. Small instances

243 views • 9 slides
L2AP: Fast Cosine Similarity Search With Prefix L-2 Norm Bounds David C. Anastasiu and George

L2AP: Fast Cosine Similarity Search With Prefix L-2 Norm Bounds David C. Anastasiu and George

L2AP: Fast Cosine Similarity Search With Prefix L-2 Norm Bounds David C. Anastasiu and George Karypis University of Minnesota, Minneapolis, MN, USA April 3, 2014 1 / 27 All-Pairs Similarity Search (APSS) Goal For each object in a set,

803 views • 42 slides
Touch Hardware: How Do Modern Touchscreens Work? (Material originally from Craig Tashman) Intro

Touch Hardware: How Do Modern Touchscreens Work? (Material originally from Craig Tashman) Intro

Touch Hardware: How Do Modern Touchscreens Work? (Material originally from Craig Tashman) Intro Why the focus on touchscreen hardware rather than pens? l Unlike pens, cant rely in anything in the stylus (unless we get implants in

845 views • 60 slides
Annual General Meeting Wednesday 27th June 2018, 8pm Mill Lane, Wigginton, York, YO32 2PY Tel:

Annual General Meeting Wednesday 27th June 2018, 8pm Mill Lane, Wigginton, York, YO32 2PY Tel:

Annual General Meeting Wednesday 27th June 2018, 8pm Mill Lane, Wigginton, York, YO32 2PY Tel: 01904 763567 www.wiggintonsquash.co.uk Agenda Treasurers Report Bar Chairmans Report Match Secretary Report Membership Report

1.51k views • 41 slides
Turkey @PVFinancing PV Financing EU-wide webinar, Wednesday 17 May 2017 SolarPower Europe This

Turkey @PVFinancing PV Financing EU-wide webinar, Wednesday 17 May 2017 SolarPower Europe This

Solar business models in Italy, Spain and Turkey @PVFinancing PV Financing EU-wide webinar, Wednesday 17 May 2017 SolarPower Europe This project has received funding from the European Unions Horizon 2020 research and innovation programme

1.13k views • 74 slides
H.E.S.S. DISCOVERY OF VHE EMISSION FROM PKS 0736+017: on the location of the g -ray emitting

H.E.S.S. DISCOVERY OF VHE EMISSION FROM PKS 0736+017: on the location of the g -ray emitting

H.E.S.S. DISCOVERY OF VHE EMISSION FROM PKS 0736+017: on the location of the g -ray emitting region in FSRQs Matteo Cerruti, Jean-Philippe Lenain, Heike Prokoph, for the H.E.S.S. Collaboration ICRC 2017, Busan, South Korea 1 07/13/17 THE T

316 views • 20 slides
Testbed for Tactical Networking and International Collaboration in Maritime Interdiction

Testbed for Tactical Networking and International Collaboration in Maritime Interdiction

Testbed for Tactical Networking and International Collaboration in Maritime Interdiction Operations Dr. Alex Bordetsky Center for Network Innovation and Experimentation Information Sciences Department, GSOIS Naval Postgraduate School, Monterey

529 views • 30 slides
bung zur Vorlesung Mensch-Maschine-Interaktion Raphael Wimmer Ludwig-Maximilians-Universitt

bung zur Vorlesung Mensch-Maschine-Interaktion Raphael Wimmer Ludwig-Maximilians-Universitt

bung zur Vorlesung Mensch-Maschine-Interaktion Raphael Wimmer Ludwig-Maximilians-Universitt Mnchen Wintersemester 2008/2009 (basierend auf den Folien von Paul Holleis, WS 06/07) Ludwig-Maximilians-Universitt Mnchen Raphael Wimmer

715 views • 24 slides
6/18/2018 A Weighty Responsibility Honoring parents is so important to God that it made

6/18/2018 A Weighty Responsibility Honoring parents is so important to God that it made

6/18/2018 A Weighty Responsibility Honoring parents is so important to God that it made his top ten list of commandments. Deuteronomy 5:16, NIV Honor your father and mother, as the Lord your God has commanded you Your parents are to

339 views • 4 slides
What do we see ? Kai Schweda 1/53 LHC lecture, Heidelberg, 1 Feb, 2010 Hadron spectra from RHIC

What do we see ? Kai Schweda 1/53 LHC lecture, Heidelberg, 1 Feb, 2010 Hadron spectra from RHIC

What do we see ? Kai Schweda 1/53 LHC lecture, Heidelberg, 1 Feb, 2010 Hadron spectra from RHIC p+p and Au+Au collisions at 200 GeV Full kinematic reconstruction of (multi-) strange hadrons in large acceptance of STAR White papers - STAR:

909 views • 53 slides
Hydrodynamic approach to nuclear collisions at beam energy scan energies Akihiko Monnai (KEK) In

Hydrodynamic approach to nuclear collisions at beam energy scan energies Akihiko Monnai (KEK) In

Hydrodynamic approach to nuclear collisions at beam energy scan energies Akihiko Monnai (KEK) In collaboration with: Bjrn Schenke (BNL) and Chun Shen (Wayne) AM, B. Schenke, C. Shen, arXiv:1902.05095 [nucl-th] Hadron Interactions and

456 views • 44 slides

More recommend