• Recent
  • Class
  • Inventors
  • Assignees
  • Top Lists
  • Pricing
  • Account
Patents-Review.com
  1. Home
  2. Inventor
  3. P
  4. Pre…
  5. PREUSSER Thomas Bernd
🔗 Permalink
Inventor profile of:

Thomas Bernd PREUSSER

City:

Dresden

Country:

Germany

Published Applications:

6

Last publication date:

2026-06-25

Recent patent applications by PREUSSER Thomas Bernd

Thomas Bernd PREUSSER from Dresden, DE has applied for patents for these inventions. The list has both pending applications and granted patents:

#1 | 2026-06-25
US20260178694A1
Physics

BOOLEAN MATRIX FACTORIZATION FOR LUT-BASED NEURAL NETWORKS

#2 | 2026-04-16
US20260104857A1
Physics

QUANTIZING LOW-PRECISION NEURAL NETWORKS FOR LOSSLESS ACCUMULATION

#3 | 2026-03-05
US20260064369A1
Physics

OPTIMIZED HARDWARE IMPLEMENTATIONS FOR MONOTONIC, NON-DECREASING THRESHOLDING

#4 | 2026-02-26
US20260057251A1
Physics

SPATIALLY PIPELINED BINARY SEARCH IN SORTED ARRAYS

#5 | 2025-04-03
US20250111231A1
Physics

PRUNING OF TECHNOLOGY-MAPPED MACHINE LEARNING-RELATED CIRCUITS AT BIT-LEVEL GRANULARITY

#6 | 2025-01-02
US20250004718A1
Physics

ONE-DIMENSIONAL CONVOLUTION BY BINARY SEGMENTATION ON DSP SLICES

InventorID:

6888070 ⎘

  1. Home
  2. Inventor
  3. P
  4. Pre…
  5. PREUSSER Thomas Bernd

Some parts © 2022-2026 Patents-Review.com

Browse & Discovery
  • Home
  • Patent Classification
  • Inventor Index
  • Assignee Index
  • Interesting Applications
Search & Tools
  • Basic Search
  • Advanced Search
  • Patent Alerts
  • Top Lists
  • Statistics
Information & Resources
  • About US Patent System
  • Terms & Privacy
  • Pricing
  • Contact
Quick Access
  • Latest Applications
  • Top Inventors 2026
  • Top Assignees 2026
  • Featured Patents
Disclaimer: This website is intended for informational purposes only, and its content is based on public patent records. Please note that some sections of this website have been created or processed using machine learning models. We provide content in good faith but make no guarantees regarding accuracy or completeness. By using this site, you accept any risks and waive claims against us for errors or omissions.