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
Fostering collaboration among CPS professionals in academia, government, and industry
CPS-VO
Approximation algorithms
biblio
Understanding Data Science Lifecycle Provenance via Graph Segmentation and Summarization
Submitted by
aekwall
on Mon, 03/30/2020 - 11:33am
Data models
Resiliency
Human behavior
pubcrawl
composability
graph theory
Metrics
query processing
Databases
context-free grammars
optimisation
computational complexity
meta data
metadata
Writing
Pipelines
Semantics
Provenance
data science
data handling
approximation theory
Approximation algorithms
boundary criteria
context free language
context-free grammar
data science lifecycle provenance
data science platforms
destination vertices
graph data models
graph query
graph query model
graph segmentation operator
graph summarization operator
high-level graph query operators
model management
provenance ingestion mechanisms
provenance management
PSPACE-complete
query techniques
Skeleton
source vertices
biblio
Maximizing Social Welfare in Fractional Hedonic Games using Shapley Value
Submitted by
aekwall
on Mon, 02/10/2020 - 12:08pm
Scalability
game theory
pubcrawl
graph theory
Social network services
multi-agent systems
5G mobile communication
Games
Stability analysis
Human Factors
Benchmark testing
social sciences
3G mobile communication
agent-based methods
Approximation algorithms
CFSV
coalition formation
coalition generation problem
decision rules
fractional hedonic games
optimal coalition structure
player payoffs
Shapley value
Shapley value-based welfare distribution scheme
Social Welfare
Social Agents
biblio
Graph-Based APT Detection
Submitted by
grigby1
on Mon, 06/10/2019 - 1:59pm
advanced persistent threats
antiviruses
Approximation algorithms
Batch production systems
Browsers
detection system
graph model
graph theory
graph-based APT detection
HTTP traffic
Human behavior
Image edge detection
invasive software
Malware Analysis
Metrics
Organizations
privacy
Protocols
pubcrawl
Resiliency
Servers
undocumented attacks
Web interface
biblio
Botnet Homology Method Based on Symbolic Approximation Algorithm of Communication Characteristic Curve
Submitted by
grigby1
on Fri, 04/05/2019 - 10:23am
Approximation algorithms
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
Compositionality
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
homology
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
pattern clustering
Protocols
pubcrawl
resilience
Resiliency
Servers
symbolic approximation algorithm
telecommunication traffic
time series
Time series analysis
time warp simulation
biblio
Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree Algorithm
Submitted by
grigby1
on Mon, 01/21/2019 - 12:38pm
data structures
pubcrawl
Human behavior
Metrics
Resiliency
Scalability
computational complexity
Data models
graph theory
Adaptation models
Approximation algorithms
query processing
computer science
Heuristic algorithms
adaptive adversarial model
adaptive adversaries applied
approximate fill degrees
approximate greedy minimum degree orderings
approximation theory
combinatorial mathematics
combinatorial scientific computing
graph sketching
matrix elimination orderings
minimum degree algorithm
minimum fill degree
nearly-linear time algorithm
oblivious adversary model
polylogarithmic time
provable approximation
randomised algorithms
randomized data structure
sketching data structure
Sparse matrices
Adversary Models
biblio
A tool to compute approximation matching between windows processes
Submitted by
aekwall
on Wed, 01/16/2019 - 2:08pm
tools
pubcrawl
Metrics
Resiliency
composability
malware
Cryptography
microsoft windows
Microsoft Windows (operating systems)
Approximation algorithms
approximation matching algorithms
Binary codes
bytewise approximate matching
cryptographic hash values
cryptographic hashing functions
digital forensics scenarios
dumping process
executable file
file organisation
forensic analysis
forensic memory analysis
Forensics
forensics memory image
Image forensics
image matching
memory image file
volatility
Windows
Windows memory dump
windows processes
Windows Operating System Security
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
Algorithm design and analysis
Approximation algorithms
Approximation methods
approximation theory
distance constrained vehicle routing problem
energy-constrained MC
inapproximability bound
large-scale wireless rechargeable sensor networks
Measurement
minimum mobile charger problem
MinMCP
mobile charger
Mobile communication
mobile computing
NP-hard
optimisation
recharging routes
sensor node
wireless sensor networks
WRSN
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
Approximation algorithms
Approximation methods
approximation theory
Bismuth
close-to-optimal performance
cooperative communication
cooperative networks
fairness
M21 traffic
many-to-one traffic
Max-Min Throughput
Max-Total Throughput
Mobile communication
mobile computing
mobile system
relay networks (telecommunication)
Relays
rounding mechanism
shared relay assignment
source-destination pair
SRA
telecommunication traffic
Throughput
wireless access network
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
1
2
next ›
last »
