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
approximation theory
biblio
Approximate Symbolic Explanation for Neural Network Enabled Water-Filling Power Allocation
Submitted by aekwall on Mon, 03/01/2021 - 4:03pm
fading channels
symbolic mapping
slow iterative search
OFDM sub-channels
NN power allocation solution
neural network enabled water-filling power allocation
Meijer G-function
iterative WF threshold search process
direct high-dimensional mapping
channel gain
approximate symbolic explanation
Search Space
OFDM modulation
Transforms
xai
Scalability
approximation theory
wireless
Artificial Neural Networks
telecommunication computing
neural nets
optimization
Iterative methods
Wireless communication
resource management
deep learning
pubcrawl
Resiliency
machine learning
biblio
Fast Scalable Approximate Nearest Neighbor Search for High-dimensional Data
Submitted by aekwall on Mon, 02/22/2021 - 12: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
Sparser: Secure Nearest Neighbor Search with Space-filling Curves
Submitted by aekwall on Mon, 02/22/2021 - 12:45pm
nearest neighbor search
strengthening privacy
Sparser pre-processes plaintext data
space-filling perturbation
Space-filling curve
secure nearest neighbor search
perturbation
nearest neighbor queries
logarithmic time
approximate nearest neighbors
approximate nearest neighbor search solution
order-preserving encryption
Cryptography
space-filling curves
approximation theory
Predictive Metrics
Curve fitting
Measurement
query processing
pubcrawl
nearest neighbour methods
data privacy
encrypted data
biblio
SRVB cryptosystem: another attempt to revive Knapsack-based public-key encryption schemes
Submitted by aekwall on Mon, 01/25/2021 - 11:59am
mathematical simplicity
knapsack problems
knapsack schemes
knapsack-based asymmetric encryption schemes
knapsack-based cryptography
knapsack-based encryption schemes
Knapsack-based public-key encryption schemes
Lattice Oracle
lattice problems oracle attacks
Knapsack Problem
Merkle-Hellman Cryptosystem
modern telecommunication technology
public-key cryptosystem
Shamir Cryptanalysis
SRVB cryptosystem
Subset Sum Problem
ubiquitous building block
Communications technology
Resiliency
Human behavior
pubcrawl
composability
Cryptography
Metrics
Lattices
public key cryptography
encryption
public-key cryptography
approximation theory
Asymmetric Encryption
algorithmic simplicity
consistent security improvements
Diophantine Approximation
Diophantine approximations based attacks
biblio
Asynchronous Parallel Surrogate Optimization Algorithm Based on Ensemble Surrogating Model and Stochastic Response Surface Method
Submitted by grigby1 on Fri, 11/20/2020 - 12:53pm
parallel optimization algorithm
asynchronous parameter optimization
black-box function optimization
ensemble surrogating model
model integration mode
parallel computing
parallel computing framework
parallel computing resources
parallel computing technology
asynchronous parallel surrogate optimization algorithm
parallel parameter space sampling mechanism
parallel sampling mechanism
Quantitative Trading
response surface methodology
stochastic response surface method
surrogate model-based optimization algorithm
Stochastic Computing Security
Adaptation models
uncertainty handling
parallel algorithms
approximation theory
inference mechanisms
ensemble model
optimisation
Load modeling
Stochastic processes
Computational modeling
Scalability
optimization
Resiliency
resilience
pubcrawl
Predictive models
biblio
Quick and Accurate False Data Detection in Mobile Crowd Sensing
Submitted by grigby1 on Wed, 10/14/2020 - 11:40am
MCS
wireless sensor networks
SVD
Sparse matrices
Smartphones
singular value decomposition
sensors
sensor fusion
Roads
Resiliency
resilience
pubcrawl
Monitoring
mobile crowd sensing
mobile computing
approximation theory
Matrix Separation
Matrix decomposition
Matrix converters
low-rank matrix approximation
LightLRFMS
light weight low rank and false matrix separation algorithm
Iterative methods
iteration process
Human behavior
False Data Detection
DRMF
direct robust matrix factorization
cyber physical systems
composability
biblio
Dynamic Adaptation of Approximate Bit-width for CNNs based on Quantitative Error Resilience
Submitted by grigby1 on Tue, 10/06/2020 - 12:40pm
dynamic adaptation
Resiliency
resilience
quantitative error resilience
pubcrawl
Power demand
power consumption
power aware computing
Neurons
logic circuits
Hardware
error resilience
dynamic adaptation of approximate bit-width
adders
convolutional neural networks
convolutional neural network
convolutional neural nets
convolution
configurable adder
Computing Theory
CNNs
approximation theory
approximate computing technology
approximate computing
approximate bit-width
biblio
Trust-Region Minimization Algorithm for Training Responses (TRMinATR): The Rise of Machine Learning Techniques
Submitted by grigby1 on Mon, 10/05/2020 - 1:11pm
Scalability
Neural networks
Newton method
nonconvex functions
optimisation
optimization
pubcrawl
Quasi-Newton methods
resilience
Resiliency
memory storage
security
Signal processing algorithms
storage management
Training
training responses
TRMinATR
Trust-region methods
trust-region minimization algorithm
Hessian matrices
computational complexity
computer architecture
computer theory
deep learning
Europe
gradient descent methods
gradient methods
Hessian approximations
approximation theory
Hessian matrix inversion
Human Factors
learning (artificial intelligence)
limited memory BFGS quasiNewton method
Limited-memory BFGS
Line-search methods
machine learning
matrix inversion
biblio
Design of Highly Nonlinear Substitution Boxes Based on I-Ching Operators
Submitted by grigby1 on Mon, 10/05/2020 - 1:02pm
intrication operator
turnover operator
substitution box (S-Box)
strict avalanche criterion
S-boxes
pubcrawl
probability
periodicity property
periodicity measure
periodic iterated function (PIF)
nonlinear substitution boxes
mutual operator
mathematical operators
linear approximation probability
linear approximation
ancient Chinese I-Ching philosophy
identity measure
ICO
I-Ching operators (ICOs)
I-Ching operators
I-Ching
encryption
differential approximation probability
Cryptography
compositionality measure
Compositionality
Boolean functions
Boolean function
approximation theory
biblio
Recycled ADMM: Improve Privacy and Accuracy with Less Computation in Distributed Algorithms
Submitted by aekwall on Mon, 09/28/2020 - 10:55am
iterative process
Scalability
Resiliency
recycled ADMM
R-ADMM
pubcrawl
privacy-utility tradeoff
privacy analysis
privacy
Perturbation methods
optimization
local data
linear approximation
alternating direction method of multiplier
Iterative methods
Human behavior
distributed algorithms
differential privacy
decentralized convex optimization problems
data privacy
convex programming
Convex functions
convergence
Computing Theory and Privacy
approximation theory
1
2
3
next ›
last »