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
› Go to login screen
Not a member?
Click here to register!
Forgot username or password?
Cyber-Physical Systems Virtual Organization
Read-only archive of site from September 29, 2023.
CPS-VO
high-dimensional data
biblio
A Visual Analytics Approach for the Diagnosis of Heterogeneous and Multidimensional Machine Maintenance Data
Submitted by grigby1 on Thu, 05/19/2022 - 1:24pm
Clustering algorithms
maintenance logs
heterogeneous data
text analytics
visual analytics
Learning systems
dimensionality reduction
Data visualization
high-dimensional data
machine learning
Metrics
Data mining
composability
Scalability
Human behavior
pubcrawl
Organizations
biblio
Fast Scalable Approximate Nearest Neighbor Search for High-dimensional Data
Submitted by aekwall on Mon, 02/22/2021 - 1:45pm
load balancing
Load management
high-dimensional data
graph-based sequential approximate k-NN search algorithm
hierarchical navigable small world
HNSW
k-d tree-based solution
k-nearest neighbor search
K-NN search
nearest neighbor search
MPI one-sided communication
MPI-OpenMP solution
Nearest neighbor methods
parallel algorithms
similarity search
Vantage Point Tree
vantage point trees
Measurement
learning (artificial intelligence)
machine learning
pubcrawl
graph theory
Big Data
query processing
trees (mathematics)
Data mining
machine learning algorithms
application program interfaces
Predictive Metrics
Partitioning algorithms
approximation theory
Approximation algorithms
message passing
search problems
biblio
A Novel Correlation-Based CUR Matrix Decomposition Method
Submitted by aekwall on Mon, 02/15/2021 - 4:44pm
high-dimensional data
decomposition
web data
singular value decomposition
novel correlation-based CUR matrix decomposition method
matrix decomposition techniques
matrix approximation
Low-Rank Approximations
important approximation technique
pubcrawl
data matrix
CUR matrix decomposition method
CUR Matrix Decomposition
correlation theory
Matrix decomposition
Compositionality
cyber physical systems
Metrics
biblio
An Application of Storage-Optimal MatDot Codes for Coded Matrix Multiplication: Fast k-Nearest Neighbors Estimation
Submitted by grigby1 on Fri, 05/22/2020 - 2:39pm
parallel processing
faster query execution
high memory footprint
in-memory indexes
K-NN search
MatDot codes
matrix multiplication
model parallelism
model-parallel architecture
MRPT
multiple random projection trees
nearest neighbor estimation
fast k-nearest neighbors
query response time
query time
single compute node
single processing node
storage constraints
storage-optimal MatDot Codes
storage-optimal recovery threshold
straggler and failure tolerance
straggler-prone environment
Systematics
worker nodes
nearest neighbor search
Indexes
Data models
Computational modeling
Big Data
trees (mathematics)
Metrics
Measurement
nearest neighbour methods
data storage
query processing
mathematics computing
pubcrawl
high-dimensional data
Approximation algorithms
approximate nearest neighbor algorithms
candidate points
coded computing
coded matrix multiplication
computation efforts
computation strategy
distributed computing cluster
distributed processing
Euclidean distance calculations
biblio
A Nearest Neighbor Search Engine Using Distance-Based Hashing
Submitted by grigby1 on Fri, 05/22/2020 - 2:38pm
query processing
query point
high-dimensional data
hardware search engine
FPGA-based nearest neighbor search engine
flexible distance-based hashing
distance based hashing
nearest neighbor search algorithm
nearest neighbor search
file organisation
pubcrawl
search problems
search engines
nearest neighbour methods
Measurement
Metrics
parallel processing
field programmable gate arrays
FPGA
biblio
Stream-Based Machine Learning for Network Security and Anomaly Detection
Submitted by grigby1 on Fri, 02/22/2019 - 4:04pm
Data Stream mining
high-dimensional data
machine learning
network attacks
pubcrawl
Resiliency
Scalability
security
Stochastic computing
biblio
Grid-Based Indexing and Search Algorithms for Large-Scale and High-Dimensional Data
Submitted by grigby1 on Mon, 06/11/2018 - 3:43pm
public databases
Measurement
Metrics
nearest neighbor search
nearest neighbor search algorithm
Nearest neighbor searches
parallel implementation
Partitioning algorithms
pubcrawl
massive information
Quantization (signal)
query processing
retrieval
search algorithms
Search methods
search problems
single machine
synthetic databases
grid-based index structure
Clustering algorithms
data handling
data index structure
database indexing
feature extraction
graph theory
grid cells
grid computing
approximate nearest neighbor search
high-dimensional data
high-dimensional database
high-dimensional feature vectors
index data
indexing
internet
large-scale data
large-scale database
biblio
Privacy-Preserving Visual Learning Using Doubly Permuted Homomorphic Encryption
Submitted by grigby1 on Thu, 02/15/2018 - 11:39am
resilience
novel efficient encryption scheme
privacy
privacy-preserving framework
privacy-preserving methods
privacy-preserving visual learning
private data
private information
pubcrawl
multiple classifiers
Resiliency
Scalability
sparse data
Videos
visual classifiers
visual recognition methods
visualization
homomorphic cryptosystem
Artificial Intelligence
computer vision
Cryptography
data privacy
Distributed databases
doubly permuted homomorphic encryption
encryption
high-dimensional data
AI
Human behavior
human factor
Human Factors
Image Processing
learning (artificial intelligence)
learning procedure
leveraging distributed private image data
biblio
Robust Hashing With Local Models for Approximate Similarity Search
Submitted by BrandonB on Wed, 05/06/2015 - 11:55am
robust hashing
Nickel
optimal hash code
query data point
query hash code
query processing
real-life datasets
RHLM
robust hash function learning
loss function
robust hashing-with-local models
Robustness
search efficiency
search quality
Training
Training data
training data points
training dataset
high-dimensional data
approximate similarity search
binary hash codes
computational complexity
database point
Databases
dimensionality curse
feature dimensionality
file organisation
1-norm minimization
high-dimensional data point mapping
indexing
l2
Laplace equations
Linear programming
local hashing model
local structural information
