yusuke1997/dblp-id-title huggingface dataset:
The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy - (Extended Abstract)
AND Protocols Using only Uniform Shuffles
Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity
A Unified Categorical Approach for Attributed Graph Rewriting
A Characterization of Cellular Automata Generated by Idempotents on the Full Shift
Language Equations with Symmetric Difference
Neural-Network Based Physical Fields Modeling Techniques
Computer Science - Theory and Applications - 15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 - July 3, 2020, Proceedings
Algorithmic Statistics: Normal Objects and Universal Models
Analysis of an Efficient Reduction Algorithm for Random Regular Expressions Based on Universality Detection
Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates
The Clever Shopper Problem
Computer Science - Theory and Applications - 11th International Computer Science Symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9-13, 2016, Proceedings
Computational Hardness of Multidimensional Subtraction Games
Operations on Boolean and Alternating Finite Automata
Analytic Modeling of Channel Traffic in n -Cubes
Evidence Reconstruction of Epistemic Modal Logic S5
On Subword Complexity of Morphic Sequences
A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem
A Fast Branching Algorithm for Cluster Vertex Deletion
Matched Instances of Quantum Satisfiability (QSat) - Product State Solutions of Restrictions
Approximation Algorithms for the Maximum Carpool Matching Problem
Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems
Approximability Distance in the Space of H -Colourability Problems
Uniform CSP Parameterized by Solution Size is in W[1]
Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results
Groupoid Action and Rearrangement Problem of Bicolor Arrays by Prefix Reversals
Quantum Algorithm for Distribution-Free Junta Testing
Type Theory and Formalisation of Mathematics
More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding
Coloring a Dominating Set Without Conflicts: q-Subset Square Coloring
Computer Science - Theory and Applications - 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6-10, 2018, Proceedings
A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata
Block Products and Nesting Negations in FO2
Real Numbers, Chaos, and the Principle of a Bounded Density of Information
Lower Bounds on Frequency Estimation of Data Streams (Extended Abstract)
Complete Complexity Classification of Short Shop Scheduling
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
From Invariants to Canonization in Parallel
Identical Relations in Symmetric Groups and Separating Words with Reversible Automata
Maximal Intersection Queries in Randomized Graph Models
Advances in Parameterized Verification of Population Protocols
Non-crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
Additive Preconditioning for Matrix Computations
On Decidability of Regular Languages Theories
Graph Sketching and Streaming: New Approaches for Analyzing Massive Graphs
On the Parameterized Complexity of the Expected Coverage Problem
Linear Temporal Logic with Until and Before on Integer Numbers, Deciding Algorithms
Two-Way Automata Characterizations of L/poly versus NL
Computer Science - Theory and Applications - 6th International Computer Science Symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14-18, 2011. Proceedings
Computing All MOD-Functions Simultaneously
Model Checking for String Problems
Canonical Decomposition of a Regular Factorial Language
Complexity of Polynomial Multiplication over Finite Fields
Speedable Left-c.e. Numbers
A Polynomial-Time Algorithm for Outerplanar Diameter Improvement
Primal Implication as Encryption
Simple Stochastic Games, Mean Payoff Games, Parity Games
Weighted Rooted Trees: Fat or Tall?
Fourier Sparsity of GF(2) Polynomials
A Padding Technique on Cellular Automata to Transfer Inclusions of Complexity Classes
Shannon Entropy vs. Kolmogorov Complexity
A Generic Convolution Algorithm for Join Operations on Tree Decompositions
Randomness - A Computational Complexity Perspective
Lower Bound on Average-Case Complexity of Inversion of Goldreich's Function by Drunken Backtracking Algorithms
Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover
On Strong NP-Completeness of Rational Problems
Approximation Algorithms for Connectivity Augmentation Problems
Unwinding a Non-effective Cut Elimination Proof
Computer Science - Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1-5, 2019, Proceedings
Max-Cut Above Spanning Tree is Fixed-Parameter Tractable
Manipulator Path Planning in 3-Dimensional Space
Composition with Algebra at the Background - On a Question by Gurevich and Rabinovich on the Monadic Theory of Linear Orderings
Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition
Computer Science - Theory and Applications - 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings
Advancing Matrix Computations with Randomized Preprocessing
How Much Randomness is Needed to Convert MA Protocols to AM Protocols?
Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization
The Hardest Language for Conjunctive Grammars
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems
The Reachability Problem over Infinite Graphs
Vertex Disjoint Paths in Upward Planar Graphs
Some Results on more Flexible Versions of Graph Motif
Broadcast Domination on Block Graphs in Linear Time
Lambek Grammars with One Division Are Decidable in Polynomial Time
Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees
Parameterized Algorithms for Finding Highly Connected Solution
Generalized Dyck Shifts
The Limits of Quantum Computers
A Shortest Path Algorithm Based on Limited Search Heuristics
QCSP on Partially Reflexive Cycles - The Wavy Line of Tractability
Computing Longest Common Substrings Via Suffix Arrays
Functional Equations in Shostak Theories
A PDL-Like Logic of Knowledge Acquisition
Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings
k -SAT Is No Harder Than Decision-Unique- k -SAT
Comparing Universal Covers in Polynomial Time
On the Decision Trees with Symmetries
Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics
Non-black-box Techniques in Cryptography
Gate Elimination for Linear Functions and New Feebly Secure Constructions
On Coloring of Sparse Graphs
Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height
Representation of (Left) Ideal Regular Languages by Synchronizing Automata
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized
A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels
Multi-agent Explicit Knowledge
Symbolic Models for Single-Conclusion Proof Logics
Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees
Random Generation of Deterministic Acyclic Automata Using the Recursive Method
Fast Motif Search in Protein Sequence Databases
Approximating the Minimum Length of Synchronizing Words Is Hard
The Descriptive Complexity of Subgraph Isomorphism Without Numerics
On the CSP Dichotomy Conjecture
Upper Bounds on Communication in Terms of Approximate Rank
One-Nonterminal Conjunctive Grammars over a Unary Alphabet
Recent Results on Polynomial Identity Testing
Realizability of Dynamic MSC Languages
The Probabilistic Min Dominating Set Problem
Symmetry of Information and Nonuniform Lower Bounds
Large Clique is Hard on Average for Resolution
The max quasi-independent set Problem
Quotient Complexity of Closed Languages
Pseudo-random Graphs and Bit Probe Schemes with One-Sided Error
Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems
The Power of Leibniz-Like Functions as Oracles
Multi-weighted Automata and MSO Logic
Concatenation Hierarchies: New Bottle, Old Wine
Definable Subsets of Polynomial-Time Algebraic Structures
Transition Property for Cube-Free Words
Slopes of 3-Dimensional Subshifts of Finite Type
Graph Editing to a Given Degree Sequence
Circuit Lower Bounds for Average-Case MA
Improving on Gutfreund, Shaltiel, and Ta-Shma's Paper "If NP Languages Are Hard on the Worst-Case, Then It Is Easy to Find Their Hard Instances"
On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract)
Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations
Testing Low Degree Trigonometric Polynomials
A Fast Algorithm for Path 2-Packing Problem
Shared-Memory Systems and Charts
Quotient Structures and Groups Computable in Polynomial Time
Depth Reduction for Circuits with a Single Layer of Modular Counting Gates
The Optimal Strategy for the Average Long-Lived Consensus
Monotone Complexity of a Pair
Online Bounded Analysis
The GKK Algorithm is the Fastest over Simple Mean-Payoff Games
Max-Closed Semilinear Constraint Satisfaction
On Emptiness and Membership Problems for Set Automata
Input-Driven Pushdown Automata on Well-Nested Infinite Strings
New Bounds for MAX-SAT by Clause Learning
Discrete Versions of the KKM Lemma and Their PPAD-Completeness
Computer Science - Theory and Applications, Fourth International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009. Proceedings
On Random Ordering Constraints
Recognizing Read-Once Functions from Depth-Three Formulas
On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone
Parameterizing Edge Modification Problems Above Lower Bounds
Faster 2-Disjoint-Shortest-Paths Algorithm
A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames
Potential Functions in Strategic Games
Planar Dimer Tilings
A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes
On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains
Multilayer Neuro-fuzzy Network for Short Term Electric Load Forecasting
Universality of Regular Realizability Problems
The Budgeted Unique Coverage Problem and Color-Coding
Proved-Patterns-Based Development for Structured Programs
Online Labeling: Algorithms, Lower Bounds and Open Questions
A Polynomial Time Delta-Decomposition Algorithm for Positive DNFs
Notes on Resolution over Linear Equations
New Bounds for the Flock-of-Birds Problem
Making Randomness Public in Unbounded-Round Information Complexity
Equations over Free Inverse Monoids with Idempotent Variables
Concatenation of Regular Languages and Descriptional Complexity
Improved Technique of IP Address Fragmentation Strategies for DoS Attack Traceback
Variants of the Determinant Polynomial and the VP-Completeness
Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism
The Query Complexity of Witness Finding
The Next Whisky Bar
Real τ-Conjecture for Sum-of-Squares: A Unified Approach to Lower Bound and Derandomization
A Semantic Proof of Polytime Soundness of Light Affine Logic
Bit-Complexity of Solving Systems of Linear Evolutionary Partial Differential Equations
Randomized and Symmetric Catalytic Computation
Worst-Case Optimal Priority Queues via Extended Regular Counters
Reconstructing a Convex Polygon from Its \omega ω -cloud
The Subtrace Order and Counting First-Order Logic
Randomized Communication Complexity of Approximating Kolmogorov Complexity
Obtaining Online Ecological Colourings by Generalizing First-Fit
Computer Science - Theory and Applications, First International Symposium on Computer Science in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings
Classical Simulation and Complexity of Quantum Computations
Approximate Methods for Constrained Total Variation Minimization
Equilibria in Quantitative Reachability Games
Abelian Repetition Threshold Revisited
Polarized Subtyping for Sized Types
Two Combinatorial Criteria for BWT Images
Popularity in the Generalized Hospital Residents Setting
Formal Verification of Gate-Level Computer Systems
Logic and Rational Languages of Words Indexed by Linear Orderings
Operations on Self-Verifying Finite Automata
New Plain-Exponential Time Classes for Graph Homomorphism
Well-Founded and Partial Stable Semantics Logical Aspects
Complexity of the Bollobás-Riordan Polynomial
The Most General Conservation Law for a Cellular Automaton
A New Scaling Kernel-Based Fuzzy System with Low Computational Complexity
Breaking Anonymity by Learning a Unique Minimum Hitting Set
Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings
Equivalence Problems for Circuits over Sets of Natural Numbers
Undecidable Word Problem in Subshift Automorphism Groups
Logic of Proofs for Bounded Arithmetic
Public Key Encryption and Encryption Emulation Attacks
Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas
Faster Polynomial Multiplication via Discrete Fourier Transforms
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth
Computer Science - Theory and Applications - 12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017, Proceedings
Nondeterministic Unitary OBDDs
Marrying Words and Trees
The Cantor Space as a Generic Model of Topologically Presented Knowledge
A New Hybrid Directory Scheme for Shared Memory Multi-processors
Decidability and Enumeration for Automatic Sequences: A Survey
Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes
Bulk Synchronous Parallel ML: Semantics and Implementation of the Parallel Juxtaposition
Automath Type Inclusion in Barendregt's Cube
On Closed-Rich Words
Shelah-Stupp's and Muchnik's Iterations Revisited
Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width
Random Selection in Few Rounds
Alphabetic Minimax Trees in Linear Time
Cyclic Shift on Prefix-Free Languages
Central Positions in Social Networks
Optimal Difference Systems of Sets with Multipliers
Inductive Type Schemas as Functors
Injective Colouring for H-Free Graphs
A Triple Correspondence in Canonical Calculi: Strong Cut-Elimination, Coherence, and Non-deterministic Semantics
Two-Way Automata versus Logarithmic Space
The Lattice of Definability. Origins, Recent Developments, and Further Directions
First-Order Logic Definability of Free Languages
An In-Place Priority Queue with O(1) Time for Push and lg n + O ( 1 ) Comparisons for Pop
Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs
Speech Enhancement in Short-Wave Channel Based on Empirical Mode Decomposition
Efficient Algorithms in Zero-Characteristic for a New Model of Representation of Algebraic Varieties
Expressiveness of Metric Modalities for Continuous Time
Resilient Quicksort and Selection
News about Semiantichains and Unichain Coverings
Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational Functions
On the Frequency of Letters in Morphic Sequences
Authentication Mechanism Using One-Time Password for 802.11 Wireless LAN
A Logspace Algorithm for Partial 2-Tree Canonization
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing
Checking Tests for Read-Once Functions over Arbitrary Bases
Editing to a Planar Graph of Given Degrees
Average-Case Rigidity Lower Bounds
Complexity of Generation
Predictions and Algorithmic Statistics for Infinite Sequences
The Quantitative Analysis of User Behavior Online - Data, Models and Algorithms
Weighted Logics for Traces
Grammar-Based Compression of Unranked Trees
Approximations of Schatten Norms via Taylor Expansions
Proof-Based Design of Security Protocols
An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents
Sensitivity Versus Certificate Complexity of Boolean Functions
Computer Science - Theory and Applications - 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings
Graphs of Bounded Treewidth Can Be Canonized in AC 1
Turing Degree Spectra of Minimal Subshifts
Compressed Word Problems in HNN-Extensions and Amalgamated Products
On the Transformation of LL(k)-linear Grammars to LL(1)-linear
Synchronous Elastic Circuits
Minimizing Branching Vertices in Distance-Preserving Subgraphs
Walking on Data Words
Explaining Symbolic Trajectory Evaluation by Giving It a Faithful Semantics
Green's Relations in Finite Transformation Semigroups
Kolmogorov Complexity as a Language
Palindromic Decompositions with Gaps and Errors
On the Computational Complexity of Reaction Systems, Revisited
Incremental Branching Programs
The Complexity of Minor-Ancestral Graph Properties with Forbidden Pairs
Separation Logic with One Quantified Variable
The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits
On the Satisfiability of Quantum Circuits of Small Treewidth
On High-Quality Synthesis
On Compiling Structured CNFs to OBDDs
Delay Games with WMSO+U Winning Conditions
Sums of Read-Once Formulas: How Many Summands Suffice?
Approximability of the Maximum Solution Problem for Certain Families of Algebras
Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams
The Normalized Algorithmic Information Distance Can Not Be Approximated
Graph Expansion, Tseitin Formulas and Resolution Proofs for CSP
Belga B-Trees
Satisfiability Thresholds beyond k -XORSAT
The Parameterized Complexity of Dominating Set and Friends Revisited for Structured Graphs
Using Coloured Petri Nets to Model and Verify Telecommunications Systems
Depth-4 Identity Testing and Noether's Normalization Lemma
All Semi-local Longest Common Subsequences in Subquadratic Time
Low-Rank Approximation of a Matrix: Novel Insights, New Progress, and Extensions
Crossing-Free Spanning Trees in Visibility Graphs of Points between Monotone Polygonal Obstacles
Approximating Minimum Power Edge-Multi-Covers
Unfolding Synthesis of Asynchronous Automata
A New Flow Control Algorithm for High Speed Computer Network
Pushing Random Walk Beyond Golden Ratio
A Partially Synchronizing Coloring
The Untold Story of SBP
Decidability of Parameterized Probabilistic Information Flow
First-Order Logic on CPDA Graphs
Abstract Modeling and Formal Verification of Microprocessors
An Improved Knapsack Solver for Column Generation
On Recognizing Words That Are Squares for the Shuffle Product
A Secure Three-Input AND Protocol with a Standard Deck of Minimal Cards
Learning Read-Constant Polynomials of Constant Degree Modulo Composites
On Expressive Power of Regular Expressions over Infinite Orders
Frameworks for Logically Classifying Polynomial-Time Optimisation Problems
Parameterized Resolution with Bounded Conjunction
On the Usage of Clustering for Content Based Image Retrieval
Approximation Schemes for Multiperiod Binary Knapsack Problems
Twelve Problems in Proof Complexity
Timers and Proximities for Mobile Ambients
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
Structural Parameterizations of Dominating Set Variants
Computer Science - Theory and Applications - 7th International Computer Science Symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings
Constructive Equivalence Relations on Computable Probability Measures
Parameterized Complexity of Fair Feedback Vertex Set Problem
On the Complexity of Matroid Isomorphism Problems
Sybil-Resilient Conductance-Based Community Growth
On Algorithmic Statistics for Space-Bounded Algorithms
Parameterized Complexity of List Coloring and Max Coloring
Facility Location on Planar Graphs with Unreliable Links
Towards Hierarchical Clustering (Extended Abstract)
Performance Modeling of Wormhole Hypermeshes Under Hotspot Traffic
Amortized Communication Complexity of an Equality Predicate
Dismal Code: Studying the Evolution of Security Bugs
2013 Workshop on Learning from Authoritative Security Experiment Results, LASER 2013, Arlington, VA, USA, October 16-17, 2013
Experimental Security Analyses of Non-Networked Compact Fluorescent Lamps: A Case Study of Home Automation Security
Web Adoption: An Attempt Toward Classifying Risky Internet Web Browsing Behavior
Is it the Typeset or the Type of Statistics? Disfluent Font does not Reduce Self-disclosure
Multi-UAV Weed Spraying
Accurate 6D Object Pose Estimation and Refinement in Cluttered Scenes
Mesoscale Patterns Identification through SST Image Processing
Generating Synthetic Training Data for Deep Learning-based UAV Trajectory Prediction
Robotics, Computer Vision and Intelligent Systems - 4th International Conference, ROBOVIS 2024, Rome, Italy, February 25-27, 2024, Proceedings
Proceedings of the 2nd International Conference on Robotics, Computer Vision and Intelligent Systems, ROBOVIS 2021, Online Streaming, October 27-28, 2021
Honeycomb Layout Inspired Motion of Robots for Topological Mapping
On-orbit Free-floating Manipulation using a Two-arm Robotic System
DCNN-based Screw Classification in Automated Disassembly Processes
Video-based Car Make, Model and Year Recognition
Operational Modeling of Temporal Intervals for Intelligent Systems
A Color Event-Based Camera Emulator for Robot Vision
Pioneering Flying Robots
Park Marking Detection and Tracking Based on a Vehicle On-Board System of Fisheye Cameras
A Comparative Study of Ego-centric and Cooperative Perception for Lane Change Prediction in Highway Driving Scenarios
Collective and Individual Decision-Making in Swarm Robotics
MDC-Net: Multimodal Detection and Captioning Network for Steel Surface Defects
A Quality-Based Criteria for Efficient View Selection
Path Following with Deep Reinforcement Learning for Autonomous Cars
Robot Vision and Deep Learning for Automated Planogram Compliance in Retail
Region Prediction for Efficient Robot Localization on Large Maps
Utilizing Dataset Affinity Prediction in Object Detection to Assess Training Data
Human Comfort Factors in People Navigation: Literature Review, Taxonomy and Framework
Evaluating Robot Posture Control and Balance by Comparison to Human Subjects using Human Likeness Measures
Robotic Finger Design Workflow for Adaptable Industrial Assembly Tasks
BiGSiD: Bionic Grasping with Edge-AI Slip Detection
Field-hardened Resilient Robotic Autonomy
The Twinning Technique of the SyncLMKD Method
Proceedings of the International Conference on Robotics, Computer Vision and Intelligent Systems, ROBOVIS 2020, Budapest, Hungary, November 4-6, 2020
Manipulating Deformable Objects with a Dual-arm Robot
DAFDeTr: Deformable Attention Fusion Based 3D Detection Transformer
Detection of Objects and Trajectories in Real-time using Deep Learning by a Controlled Robot
The Answer Is Blowing in the Wind: Directed Air Flow for Socially-acceptable Human-Robot Interaction
UCorr: Wire Detection and Depth Estimation for Autonomous Drones
Enhancing Connected Cooperative ADAS: Deep Learning Perception in an Embedded System Utilizing Fisheye Cameras
Improving Semantic Mapping with Prior Object Dimensions Extracted from 3D Models
Deployment of Multi-agent Pathfinding on a Swarm of Physical Robots Centralized Control via Reflex-based Behavior
Intelligent Algorithms for Non-parametric Robot Calibration
Implicitly using Human Skeleton in Self-supervised Learning: Influence on Spatio-temporal Puzzle Solving and on Video Action Recognition
Improving Learning in a Mobile Robot using Adversarial Training
Intelligent Classification of Different Types of Plastics using Deep Transfer Learning
Estimation of Optimal Gripper Configuration Through an Embedded Array of Proximity Sensors
Weapon Detection Using PTZ Cameras
Airborne Visual Tracking of UAVs with a Pan-Tilt-Zoom Camera