yusuke1997/dblp-id-title huggingface dataset:
A Match in Time Saves Nine: Deterministic Online Matching with Delays
An Improved Algorithm for Open Online Dial-a-Ride
Controlling Tail Risk in Two-Slope Ski Rental
Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems
Approximation and Online Algorithms - 18th International Workshop, WAOA 2020, Virtual Event, September 9-10, 2020, Revised Selected Papers
Online Algorithm for Fractional Matchings with Edge Arrivals in Graphs of Maximum Degree Three
Approximating Spanning Trees with Few Branches
Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems
Coping with Interference: From Maximum Coverage to Planning Cellular Networks
A 5/4-Approximation Algorithm for Scheduling Identical Malleable Tasks
Approximating Steiner Trees and Forests with Minimum Number of Steiner Points
Approximation and Online Algorithms - 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected Papers
Rounding of Sequences and Matrices, with Applications
Greedy Minimum-Energy Scheduling
Approximation and Complexity of k -Splittable Flows
Competitive Multi-dimensional Dynamic Bin Packing via L-Shape Bin Packing
Improved Approximation Guarantees for Lower-Bounded Facility Location
Balanced Optimization with Vector Costs
Approximation and Online Algorithms - 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers
The Hardness of Network Design for Unsplittable Flow with Selfish Users
Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish Agents
More Powerful and Simpler Cost-Sharing Methods
Tighter Approximations for Maximum Induced Matchings in Regular Graphs
Online Coloring of Intervals with Bandwidth
New Lower Bounds for Certain Classes of Bin Packing Algorithms
New Integrality Gap Results for the Firefighters Problem on Trees
Improved Analysis of Online Balanced Clustering
Non-clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times
Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs and Related Problems
Randomized Priority Algorithms: (Extended Abstract)
The Price of Anarchy for Minsum Related Machine Scheduling
Steiner Trees with Bounded RC-Delay
Dynamic Traveling Repair Problem with an Arbitrary Time Window
Malicious Bayesian Congestion Games
The Train Delivery Problem - Vehicle Routing Meets Bin Packing
The Online Piercing Set Problem with Recourse
Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows
Approximation and Online Algorithms - 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers
Tight Bounds for Double Coverage Against Weak Adversaries
Approximation and Online Algorithms, Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Papers
Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria
Pricing Network Edges to Cross a River
DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals
An FPTAS for Flows over Time with Aggregate Arc Capacities
Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling
Approximating Domination on Intersection Graphs of Paths on a Grid
Partial Multicuts in Trees
Non-greedy Online Steiner Trees on Outerplanar Graphs
Minimum Weighted Sum Bin Packing
Improved Lower Bound for Online Strip Packing - (Extended Abstract)
A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs
Approximation Algorithms for Vertex-Connectivity Augmentation on the Cycle
Continuum Armed Bandit Problem of Few Variables in High Dimensions
Fast Approximation Algorithms for Euclidean Minimum Weight Perfect Matching
Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
Network Design with Edge-Connectivity and Degree Constraints
Vertex Sparsification in Trees
Tradeoffs in Worst-Case Equilibria
Disk Graphs: A Short Survey
Multi-Criteria TSP: Min and Max Combined
Approximation Algorithms for Multi-criteria Traveling Salesman Problems
Approximation and Online Algorithms - 17th International Workshop, WAOA 2019, Munich, Germany, September 12-13, 2019, Revised Selected Papers
How to Play Unique Games on Expanders
A (4 + epsilon )-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs
Exploring Sparse Graphs with Advice (Extended Abstract)
Approximation and Online Algorithms - 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised Selected Papers
Some Easy and Some Not so Easy Geometric Optimization Problems
Advice Complexity of Priority Algorithms
Power Consumption Problems in Ad-Hoc Wireless Networks
Resource Allocation Games with Multiple Resource Classes
On Conceptually Simple Algorithms for Variants of Online Bipartite Matching
The Minimum Feasible Tileset Problem
Fault Tolerant Clustering with Outliers
To Close Is Easier Than To Open: Dual Parameterization To k-Median
Submodular Integer Cover and Its Application to Production Planning
Improved Bound for Online Square-into-Square Packing
Online Distributed Object Migration
Small Additive Error for Unsplittable Multicommodity Flow in Outerplanar Graphs
An FPT 2-Approximation for Tree-cut Decomposition
Online Packet Switching
Locating Service and Charging Stations
Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers
Capacitated Domination Problems on Planar Graphs
A k-Median Based Online Algorithm for the Stochastic k-Server Problem
Searching in Euclidean Spaces with Predictions
Improved Randomized Online Scheduling of Unit Length Intervals and Jobs
Approximate Strong Edge-Colouring of Unit Disk Graphs
Online Minimization Knapsack Problem
Optimization Problems in Multiple Subtree Graphs
Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs
Deterministic Monotone Algorithms for Scheduling on Related Machines
Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem
Bounding the Price-of-Fair-Sharing Using Knapsack-Cover Constraints to Guide Near-Optimal Cost-Recovery Algorithms
The Asymptotic Price of Anarchy for k-uniform Congestion Games
Speed Scaling of Tasks with Precedence Constraints
Efficient Vertex-Label Distance Oracles for Planar Graphs
A Faster FPTAS for Knapsack Problem with Cardinality Constraint
Approximating Maximum Edge 2-Coloring by Normalizing Graphs
Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set
On Packet Scheduling with Adversarial Jamming and Speedup
Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints
Approximating Node-Weighted k-MST on Planar Graphs
Strategic Multiway Cut and Multicut Games
Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems
Approximate Min-Sum Subset Convolution
Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems
Competitive Online Multicommodity Routing
Approximation Algorithms for the Wafer to Wafer Integration Problem
Lower Bounds for Several Online Variants of Bin Packing
Improved Approximation Algorithm for k-Level UFL with Penalties, a Simplistic View on Randomizing the Scaling Parameter
A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints
Maximizing Throughput for Parallel Jobs with Speed-Up Curves
Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint
Dynamic Offline Conflict-Free Coloring for Unit Disks
Guard Games on Graphs: Keep the Intruder Out!
Tradeoff between Energy and Throughput for Online Deadline Scheduling
Parallel Online Algorithms for the Bin Packing Problem
Batch Coloring of Graphs
Approximating δ-Covering
A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem
On Bin Packing with Conflicts
Scheduling Jobs on Identical and Uniform Processors Revisited
Stochastic Online Scheduling on Parallel Machines
Routing Under Uncertainty: The a priori Traveling Repairman Problem
Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat
Approximation and Online Algorithms, 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009. Revised Papers
List Factoring and Relative Worst Order Analysis
Approximation Algorithms for Multiple Strip Packing
Load Balancing of Temporary Tasks in the l p Norm
2-Node-Connectivity Network Design
A Primal-Dual Online Deterministic Algorithm for Matching with Delays
Priority Algorithms for Graph Optimization Problems
Smoothing Imprecise 1.5D Terrains
Size Versus Stability in the Marriage Problem
A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines
The Conference Call Search Problem in Wireless Networks
On-Line Extensible Bin Packing with Unequal Bin Sizes
Server Cloud Scheduling
Reconfiguration of Graphs with Connectivity Constraints
Online Bin Packing with Resource Augmentation
A New Lower Bound for Classic Online Bin Packing
Adaptivity Gaps for the Stochastic Boolean Function Evaluation Problem
A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path
Learning in Stochastic Machine Scheduling
Independent Set in k-Claw-Free Graphs: Conditional χ-Boundedness and the Power of LP/SDP Relaxations
Shortest Augmenting Paths for Online Matchings on Trees
Approximation and Online Algorithms, 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers
On Approximability of Connected Path Vertex Cover
Approximation Algorithm for Directed Multicuts
Submodular Function Minimization with Submodular Set Covering Constraints and Precedence Constraints
Single Approximation for Biobjective Max TSP
Bin Packing with Rejection Revisited
Approximability of Connected Factors
Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost
On Hierarchical Diameter-Clustering, and the Supplier Problem
Algorithms for Dynamic NFV Workload
Deadline TSP
A New Perspective on List Update: Probabilistic Locality and Working Set
Approximating the Throughput by Coolest First Scheduling
Approximation and Online Algorithms, 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers
Geometric Spanners with Small Chromatic Number
The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers
Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers
Robust Scheduling on Uniform Machines - New Results Using a Relaxed Approximation Guarantee
Combinatorial Interpretations of Dual Fitting and Primal Fitting
A PTAS for Delay Minimization in Establishing Wireless Conference Calls
On the Price of Stability for Undirected Network Design
Knapsack Secretary Through Boosting
A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities
Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees
Universal Bufferless Routing
Probabilistic k-Median Clustering in Data Streams
Minimal Cost Reconfiguration of Data Placement in Storage Area Network
Improved PTASs for Convex Barrier Coverage
A Randomized Algorithm for Online Unit Clustering
Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics
Maximum ATSP with Weights Zero and One via Half-Edges
A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs
Improved Approximations for Relative Survivable Network Design
Reordering Buffer Management with Advice
Geometric Hitting Set for Segments of Few Orientations
Independent Set with Advice: The Impact of Graph Knowledge - (Extended Abstract)
On the Cycle Augmentation Problem: Hardness and Approximation Algorithms
Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms
Combinatorial Techniques for Memory Power State Scheduling in Energy-Constrained Systems
EPTAS for Load Balancing Problem on Parallel Machines with a Non-renewable Resource
Online Hitting Set of d-Dimensional Fat Objects
Cut Sparsifiers for Balanced Digraphs
The Online Target Date Assignment Problem
A priori TSP in the Scenario Model
Precedence-Constrained Scheduling and Min-Sum Set Cover
A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs
Explorable Uncertainty in Scheduling with Non-uniform Testing Times
Tight Approximation Bounds for the Seminar Assignment Problem
Approximation Algorithms for Domination Search
How to Whack Moles
Online Deadline Scheduling: Team Adversary and Restart
A Randomized Algorithm for Two Servers in Cross Polytope Spaces
The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem
Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs
A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks
The Minimum Substring Cover Problem
Joint Base Station Scheduling
Online General Knapsack with Reservation Costs
Exploiting Locality: Approximating Sorting Buffers
Between a Rock and a Hard Place: The Two-to-One Assignment Problem
Several Methods of Analysis for Cardinality Constrained Bin Packing
A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem
On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems
Faster and Simpler Approximation of Stable Matchings
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
On Independent Set on B1-EPG Graphs
The Traveling k-Median Problem: Approximating Optimal Network Coverage
Approximation and Online Algorithms - 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers
A Approximation Algorithm for the Minimum Maximal Matching Problem
Approximation Results for Makespan Minimization with Budgeted Uncertainty
Probabilistic Embeddings of the Fréchet Distance
Approximation and Online Algorithms, First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers
Streaming Algorithms for Bin Packing and Vector Scheduling
Order-Preserving Transformations and Greedy-Like Algorithms
On Streaming Algorithms for Geometric Independent Set and Clique
A PTAS for the Cluster Editing Problem on Planar Graphs
The k -Allocation Problem and Its Variants
Complexity and Approximation of the Longest Vector Sum Problem
Simple On-Line Algorithms for Call Control in Cellular Networks
Improved Online Algorithm for Fractional Knapsack in the Random Order Model
Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems
A o(n) -Competitive Deterministic Algorithm for Online Matching on a Line
Contention Resolution, Matrix Scaling and Fair Allocation
A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays
Online Dynamic Programming Speedups
Improved Approximations for the Max k-Colored Clustering Problem
Simpler 3/4-Approximation Algorithms for MAX SAT
A Bicriteria Approximation Algorithm for the k-Center and k-Median Problems
Maximum Coverage with Cluster Constraints: An LP-Based Approximation Technique
Longest Increasing Subsequence Under Persistent Comparison Errors
Minimizing Cache Usage in Paging
Strong Colorings of Hypergraphs
Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations
The Online Matching Problem on a Line
Lasserre Integrality Gaps for Graph Spanners and Related Problems
Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms
Approximation Algorithms for Scheduling and Packing Problems
Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation
Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines
Asymptotically Optimal Online Page Migration on Three Points
Online Multi-Commodity Flow with High Demands
Scheduling Appointments Online: The Power of Deferred Decision-Making
Precedence-Constrained Covering Problems with Multiplicity Constraints
Online Exploration of Polygons with Holes
Any-Order Online Interval Selection
On b-Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem
Managing Multiple Mobile Resources
Improved Online Scheduling with Restarts on a Single Machine
A Tight Lower Bound for Online Convex Optimization with Switching Costs
A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs
Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line
Scheduling with Speed Predictions
A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries
Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications
Approximation and Online Algorithms - 10th International Workshop, WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers
Online String Attractors - And Their Relation to the Lempel-Ziv Factorization
The Itinerant List Update Problem
Approximation Algorithms for Scheduling Problems with Exact Delays
On the Max Coloring Problem
Stochastic Graph Exploration with Limited Resources
On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters - (Extended Abstract)
Some Anomalies of Farsighted Strategic Behavior
Sequential Metric Dimension
Expandable Mix-Zones as a Deception Technique for Providing Location Privacy on Internet-of-Battlefield Things (IoBT)
Analysis of the Demilitarized Zone Implementation in Java Madura Bali Electrical Systems to Increase the Level of IT/OT Cyber Security With the Dual DMZ Firewall Architecture Method
Enhancing the Capture Capabilities of LoRa Receivers
Towards A Smart farming for early detection of fall armyworm pest
Developing a Cyber-resilience state in Botswana's Energy Industry
Decentralized Computation Offloading in Mobile Edge Computing Systems
AI Approaches for Predictive Maintenance in Road Bridge Infrastructure
The reliability and optimal data usage of BGAN Satellite Communications for Remote Outstations
Location Aware Fog Computing Based Air Quality Monitoring System
Smart City Traffic Monitoring:YOLOv7 Transfer Learning Approach for Real-Time Vehicle Detection
Accurate Estimation of Individual Transmission Rates Through Contact Analytics Using UWB Based Indoor Location Data
Combating Malware Traffic in Emerging Networks: A Collaborative Learning Approach
A Smart Desk: A Smart Solution for Young Students
Short-Term Load Forecasting Employing Recurrent Neural Networks
Machine Learning-Based Topology Optimization in 3D Printing
Internet of Things Focused Optimal Distance and Boundary Algorithm for Smart Cities
Efficient coding of wideband ISF parameters : Application of variable rate SSVQ scheme
FPGA-based tunable Keccak core
ML-Based Service Type Priority Decision Method Using Ambient Information for 5GB
PESS: Progress Enhancing Student Support
IoT-Based Plant Disease Detection using Machine Learning: A Systematic Literature Review
Heart Disease Prediction Using Machine Learning Algorithms
Electricity Load Prediction Using Machine Learning
Time Series Forecasting of COVID-19 Mortality in SADC region with Facebook Prophet Model
Urban Intelligent Navigator for Drone Using Convolutional Neural Network (CNN)
Cybersecurity in Fitness Devices-A Systematic Literature Review
Wideband MIMO Antenna in the Shape of a Hand Grip
Design and Implementation of a Mobile Health Check Device
Unlocking the Path Towards Automation of Tiny Machine Learning for Edge Computing
Developing Smart Sustainable Cities: a Validated Transformation Framework
International Conference on Smart Applications, Communications and Networking, SmartNets 2024, Harrisonburg, VA, USA, May 28-30, 2024
Securing IoT Surveillance Airport Infrastructure
Advancing the Security of Trustworthy Self-IoT
Privacy-Preserving Randomized-MAC WiFi Client Counting with Short-Term-Coherent Waveform Features and a Bayesian Information Criterion
International Conference on Smart Applications, Communications and Networking, SmartNets 2022, Palapye, Botswana, November 29 - Dec. 1, 2022
Strategy for Community Empowerment Through an Integrated Waste Bank
International Conference on Smart Applications, Communications and Networking, SmartNets 2021, Glasgow, United Kingdom, September 22-24, 2021
Towards an Infrastructure and Architecture of Nanotechnology in Agriculture for Abu Dhabi
Lightweight Zero Knowledge Proof-Based Multi Access Control Schema for Smart Telehealth System
Towards symbolic representation-based modeling of Temporal Knowledge Graphs
IOTA Tangle 2.0: Toward a Scalable, Decentralized, Smart, and Autonomous IoT Ecosystem
Light in Tiles - IoT innovative traditional ceramic tiles
Deep Learning Applications in MIMO Systems
An Elliptical Folded Dipole With Directive Radiation for UWB Applications
Redefining Teaching and Learning Practices in the Post-Covid-19 Pandemic Era
Performance Analysis of OpenStack Controller
Communication Requirements and Deployment Challenges of Cloudlets in Smart Grid
Multi-stage Attack Detection: Emerging Challenges for Wireless Networks
Bidirectional Quantum Teleportation By Simultaneously Sending A Secret Classic Bit From Both Sides
Architecture Framework for Intelligence Orchestration in AIoT and IoT
Deployment of Next-Gen 5G NSA Networks for Awareness Campaigns in Rural Africa
Internet of Things: Analysis of Parameters and Requirements
A Secure Blockchain-based Prescription Drug Supply in Health-care Systems
Design of a Dual-band Antenna Array for CubeSat Application
Vehicles Classification and Brand Recognition Using Convolution Network and Neural Networks
On Finger Stretching and Bending Dynamics as a Biometric Modality
Generalized framework for protecting privacy in the smart grid environment and measuring the efficacy of privacy attacks
iCuSMAT-DT: A Two-Tier Detection Mechanism for High-Rate DDoS Attacks and Discriminating Benign Flash Traffic in Software-Defined Networks
Evaluating operational readiness using chaos engineering simulations on Kubernetes architecture in Big Data
A Hybridized Approach for Testing Neural Network Based Intrusion Detection Systems
Person Tracking System based on Arduino Microcontroller and Web Technologies
Machine Learning to Detect Inconsistent Data
ASDWL: Mitigating DNS Random Subdomain Attacks for Second Level Domain
Mutual Authentication Protocol using ECC and Hardware Security Module for IoT Devices
Resource-Constrained Device Characterization for Detecting Sleep Apnea Using Machine Learning
Towards a Reliable French Speech Recognition Tool for an Automated Diagnosis of Learning Disabilities
AMQP and beyond
Google Traces Analysis for Deep Machine Learning Cloud Elastic Model
Game-Theoretic Method for Optimal Initial Allocation of Honeypots for Enhanced Network Security
Applying Reservoir Computing and Machine Learning Techniques for Image Enhancement in Biomedical Imaging
Addressing Cold Start Challenges In Recommender Systems: Towards A New Hybrid Approach
An Efficient Massive MIMO Detector Based on Deep Learning and Approximate Matrix Inversion Methods
Comparative Analysis of Machine Learning Methods for Multi-Year CVD Prediction
A Network-based Distributed Data Storage System for Data Security in a Hostile Network
Protocol Stack-Aware Comparison of Centroid Localization Algorithms Based on Anchor Density Using Cooja
A Mixed Spectrum Sharing Strategy for Cognitive Radio Systems
Technologies Behind the Humanitarian Demining: A Review
On Big Data Forensic and Forensic Cloud Environment
Autoencoder-K-Means Algorithm for Efficient Anomaly Detection to Improve Space Operations
A Low Complexity Digital Front-End for CubeSat Software Defined Radio Applications
Short-Term Load Forecasting Using GRU-LGBM Fusion
Detection of Zero-Day Attacks on IoT
Evaluation of Deep Learning in Detecting Unknown Network Attacks
The Design of a Cough Disease Classification System Using Cube-Transformer
Breaking Strength of Smart Interconnected Ceramic Elements
Lightweight Intrusion Detection System with GAN-Based Knowledge Distillation