Skip to Main Content Area
  • CPS-VO
    • Contact Support
  • Browse
    • Calendar
    • Announcements
    • Repositories
    • Groups
  • Search
    • Search for Content
    • Search for a Group
    • Search for People
    • Search for a Project
    • Tagcloud
      
 
Not a member?
Click here to register!
Forgot username or password?
 
Home
National Science Foundation

Cyber-Physical Systems Virtual Organization

Read-only archive of site from September 29, 2023.

CPS-VO

randomized algorithms

biblio

Visible to the public Randomization or Condensation?: Linear-Cost Matrix Sketching Via Cascaded Compression Sampling

Submitted by grigby1 on Thu, 08/23/2018 - 11:41am
  • randomized algorithms
  • cyber-physical systems
  • pubcrawl
  • privacy
  • composability
  • resilience
  • Resiliency
  • cascaded compression sampling
  • low-rank decomposition
  • matrix sketching
  • nystrom method
  • random projection
  • compressive sampling
biblio

Visible to the public Are Shared Objects Composable Under an Oblivious Adversary?

Submitted by K_Hooper on Fri, 10/13/2017 - 10:28am
  • composability
  • Compositionality
  • Computing Theory
  • distributed algorithms
  • Linearizability
  • pubcrawl
  • randomized algorithms
  • shared memory
biblio

Visible to the public Time Adaptive Sketches (Ada-Sketches) for Summarizing Data Streams

Submitted by grigby1 on Tue, 05/16/2017 - 12:30pm
  • Algorithm
  • approximate counting algorithms
  • big-data mining
  • composability
  • count-min sketches
  • hash algorithms
  • hashing
  • Metrics
  • pubcrawl
  • randomized algorithms
  • Resiliency
  • Scalability
  • Sketching
  • streaming

Terms of Use  |  ©2023. CPS-VO