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 algorithms
biblio
Botnet Homology Method Based on Symbolic Approximation Algorithm of Communication Characteristic Curve
Submitted by grigby1 on Fri, 04/05/2019 - 10:23am
pattern clustering
internet
invasive software
IP networks
IRC botnet
IRC protocol
Metrics
most significant botnet group
multiple zombies hosts
network servers
network traffic
packet capture traffic monitoring
homology
Protocols
pubcrawl
resilience
Resiliency
Servers
symbolic approximation algorithm
telecommunication traffic
time series
Time series analysis
time warp simulation
Compositionality
botnet
botnet client
botnet control server
botnet homology method
botnets
clustering
Clustering algorithms
command and control systems
command control channels
command interaction
communication characteristic curve
Approximation algorithms
computational complexity
computer network security
dynamic network communication characteristic curves
dynamic time warping distance clustering
earliest botnet group
effective detection method
extracted curve
Heuristic algorithms
homogenous botnet
homologous botnets
biblio
Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree Algorithm
Submitted by grigby1 on Mon, 01/21/2019 - 12:38pm
pubcrawl
matrix elimination orderings
Metrics
minimum degree algorithm
minimum fill degree
nearly-linear time algorithm
oblivious adversary model
polylogarithmic time
provable approximation
Human behavior
query processing
randomised algorithms
randomized data structure
Resiliency
Scalability
sketching data structure
Sparse matrices
combinatorial scientific computing
adaptive adversarial model
adaptive adversaries applied
Adversary Models
approximate fill degrees
approximate greedy minimum degree orderings
Approximation algorithms
approximation theory
combinatorial mathematics
Adaptation models
computational complexity
computer science
Data models
data structures
graph sketching
graph theory
Heuristic algorithms
biblio
A tool to compute approximation matching between windows processes
Submitted by aekwall on Wed, 01/16/2019 - 2:08pm
digital forensics scenarios
Windows Operating System Security
windows processes
Windows memory dump
Windows
volatility
memory image file
image matching
Image forensics
forensics memory image
Forensics
forensic memory analysis
forensic analysis
file organisation
executable file
dumping process
tools
cryptographic hashing functions
cryptographic hash values
bytewise approximate matching
Binary codes
approximation matching algorithms
Approximation algorithms
Microsoft Windows (operating systems)
microsoft windows
Cryptography
malware
composability
Resiliency
Metrics
pubcrawl
biblio
Using Minimum Mobile Chargers to Keep Large-Scale Wireless Rechargeable Sensor Networks Running Forever
Submitted by el_wehby on Fri, 05/25/2018 - 3:50pm
MinMCP
WRSN
wireless sensor networks
sensor node
recharging routes
optimisation
NP-hard
mobile computing
Mobile communication
mobile charger
Algorithm design and analysis
minimum mobile charger problem
Measurement
large-scale wireless rechargeable sensor networks
inapproximability bound
energy-constrained MC
distance constrained vehicle routing problem
approximation theory
Approximation methods
Approximation algorithms
1536086
biblio
Time-constrained data harvesting in WSNs: Theoretical foundation and algorithm design
Submitted by el_wehby on Fri, 05/25/2018 - 3:49pm
Algorithm design and analysis
Approximation algorithms
Approximation methods
Computers
Conferences
NP-completeness
optimisation
polynomial approximation
polynomial-time approximation schemes
polynomials
Robot sensing systems
time-constrained data harvesting
wireless sensor networks
WSN
1536086
biblio
Shared Relay Assignment (SRA) for Many-to-One Traffic in Cooperative Networks
Submitted by el_wehby on Fri, 05/25/2018 - 3:48pm
Mobile communication
wireless access network
Throughput
telecommunication traffic
SRA
source-destination pair
shared relay assignment
rounding mechanism
Relays
relay networks (telecommunication)
mobile system
mobile computing
Approximation algorithms
Max-Total Throughput
Max-Min Throughput
many-to-one traffic
M21 traffic
fairness
cooperative networks
cooperative communication
close-to-optimal performance
Bismuth
approximation theory
Approximation methods
1536086
biblio
The Integrality Gap of the Goemans-Linial SDP Relaxation for Sparsest Cut Is at Least a Constant Multiple of $\surd$Log N
Submitted by grigby1 on Mon, 03/26/2018 - 1:09pm
Approximation algorithms
metric embeddings
Metrics
pubcrawl
resilience
Resiliency
Scalability
semidefinite programming
Sparsest Cut Problem
work factor metrics
biblio
A Homomorphic Signature Scheme for Quadratic Polynomials
Submitted by grigby1 on Tue, 01/16/2018 - 6:36pm
polynomials
Vectors
tensors
tensor products
Tensile stress
Silicon
signature vectors
Servers
Scalability
Resiliency
quadratic polynomials
pubcrawl
Approximation algorithms
polynomial functions
normal SIS problems
normal short integer solution problems
Metrics
Lattices
information security
Human Factors
homomorphic signature scheme
Homomorphic encryption
digital signatures
cloud server
biblio
Compressing Graphs and Indexes with Recursive Graph Bisection
Submitted by grigby1 on Fri, 09/15/2017 - 11:03am
Algorithms
Approximation algorithms
Compression
Data mining
distributed algorithms
Experimentation
graph algorithms
graph theory
Human behavior
linear arrangement
Malware Analysis
Metrics
privacy
pubcrawl
Resiliency
social networks
biblio
Robust and Probabilistic Failure-Aware Placement
Submitted by grigby1 on Mon, 06/05/2017 - 12:25pm
adversarial failures
Adversary Models
Approximation algorithms
data center networks
failure-aware algorithms
Fault-Tolerance
Human behavior
max-min fairness
Metrics
polynomial-time approximation scheme
probabilistic failures
pubcrawl
random key generation
Resiliency
Scalability
« first
‹ previous
1
2
3
4
5
next ›
last »
