yusuke1997/dblp-id-title huggingface dataset:
Fluidic based Multidirectional Flow Sensor Inspired from Artificial Cupula
Cooperative forensics sharing
Bio-inspired Speed Detection and Discrimination
A 3-D Hand Gesture Signature Based Biometric Authentication System for Smartphones
Physics-Based Nanomedicine to Alleviate Anomalous Events in the Human Kidney
Microtubule Motional Diffusion Coefficient in Motility Assays is Determined by Heterogeneity in Motor Stiffness
Artificial Negative Selection: Searching for an Appropriate Application Scenario
A Mathematical Model Predicting Gliding Speed of Actin Molecular Shuttles Over Myosin Motors in the Presence of Defective Motors
Biomimicking the Formation of Nacre/Shell: One Step Forward
Distributed Call Admission Control for DESYNC-TDMA in Mobile Ad Hoc Networks
Evolving Mixed Societies: A one-dimensional modelling approach
Enhanced DESYNC-TDMA Algorithm for Efficient Packet Delivery in Distributed MANETs
How does user heterogeneity affect performance of P2P caching?: Evolutionary game theoretic approach
Protein Structure Alignment in Subquadratic Time
Firing Pattern of Default Mode Brain Network with Spiking Neuron Model
Extracting Communities from Citation Networks of Patents: Application of the Brain-Inspired Mechanism of Information Retrieval
Multiscale Modeling of Information Conveyed by Gene-Regulatory Signaling
Towards a Shape Language for Interpreting RNA Folding
Modeling Epidemic Risk Perception in Networks with Community Structure
A Biologically Inspired Technique for Sampling of Color Images
BICT 2015, Proceedings of the 9th EAI International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS), New York City, United States, December 3-5, 2015
Activation-Inhibition-Based Data Highways for Wireless Sensor Networks
Molecular Communication through Gap Junction Channels: System Design, Experiments and Modeling
Propagating Waves as a Cortical Mechanism of Direction-Selectivity in V1 Motion Cells
Bio-inspired Self-organized Public Key Authentication Mechanism for Mobile Ad-hoc Networks
A noise-driven mechanism for adaptive growth rate regulation
Delay Tolerant Networks in Partially Overlapped Networks: A Non-cooperative Game Approach
Network Immunity: What can we Learn from Nature for Network Protection?
A Distributed Multi-level PSO Control Algorithm for Autonomous Underwater Vehicles
SVD-based Feature Extraction from Time-series Motion Data and Its Application to Gesture Recognition
Contagion of evacuation decision making on real map
The adaptive social hierarchy: a self organizing network based on naturally occurring structures
An ant algorithm for static and dynamic MAX-SAT problems
Cyber Security via Minority Games with Epistatic Signaling
An Empirical Comparison of Machine Learning Techniques for Software Defect Prediction
Bio-inspired Resource Allocation for Multi-hop Networks
A cell-based molecular communication network
Bio-inspired Visual Information Processing - The Neuromorphic Approach
Towards the Connected Society: Dynamic Co-Evolution of TLC Players and Individuals
An Analytical Model for Percolation in Small Link Degree Transportation Networks
A Method for the Detection of Meaningful and Reproducible Group Signatures from Gene Expression Profiles
Sensor Based Time Series Classification of Body Movement
Minimum Expected *-Cast Time in DTNs
Program Equivalence Using Neural Networks
Autonomous Function Composition for Information Network Adaptive to Changes in Service Request
Multi-objective Evolutionary Optimization of Service Provider Selection Problems with Dynamic Demands
On event-based motion detection and integration
Visuomotor Mapping Based on Hering's Law for a Redundant Active Stereo Head and a 3 DOF Arm
Bee-inspired data collection methods for P2P streaming systems
Quantitative expression analysis using oligonucleotide microarrays based on a physico-chemical model
Using Virtualization to Simulate Biological Cells
A Study of the Role of the Maintained-Discharge Parameter in the Divisive Normalization Model of V1 Neurons
Improvement of Concentration of Numeracy by Mozart Effect
Channel Design and Optimization of Active Transport Molecular Communication
Computational Power of Chemical Kinetics in Living Cells
Evaluating Motion Estimation Models from Behavioural and Psychophysical Data
A Polymer-based Piezoelectric Transducer for Real-time Monitoring Contractile Behavior of Cardiomyocytes
Asynchronous Team Algorithms for Boolean Satisfiability
Modelling to Contain Pandemic Influenza A (H1N1) with Stochastic Membrane Systems: A Work-in-Progress Paper
Evolutionary Multiobjective Fuzzy System Design
A Self-Organizing Map Architecture for Arm Reaching Based on Limit Cycle Attractors
Algebraic connectivity optimization via link addition
Modular Asynchronous Web Programming: Advantages & Challenges
Coevolution of Game Strategies, Game Structures and Network Structures
Reinforcement Learning with Internal Reward for Multi-Agent Cooperation: A Theoretical Approach
Three models for gene assembly in ciliates: a comparison
Strength-based Signal Detection in PAM OOK Concentration-Encoded Molecular Communication
Analytical Framework for Contact Time Evaluation in Delay-Tolerant Networks
SRA: A Salmon-Like Approach to MANET Routing
Digestive System Dynamics in Molecular Communication Perspectives
Autonomic Reliable Multicast Application-Level Group Communication Using Self-Organization Principles
Offset and Skew Estimation for Clock Synchronization in Molecular Communication Systems
A Mathematical Model for the Analysis of the Johnson-Nyquist Thermal Noise on the Reliability in Nano-Communications
Embryonic Models for Self-healing Distributed Services
Applying Branching Processes to Delay-Tolerant Networks
Bio-Inspired Models of Network, Information, and Computing Systems - 7th International ICST Conference, BIONETICS 2012, Lugano, Switzerland, December 10-11, 2012, Revised Selected Papers
Bio-inspired Transputer Based-Fuzzy Mobile Robot
An Algorithm to Estimate Delay Times in Petri Net Models of Signaling Pathways with Experimental Data
Multiscale Topology of Chromatin Folding
An Event Graph Model for Discovering Trends from Text Streams
An Algorithm for stable Microtubule Curvature Conformation
CoViFlowPro: A Community Visualization method based on a Flow Propagation Algorithm
A Deconvolutional Strategy for Implementing Large Patch Sizes Supports Improved Image Classification
A Global Convexity Analysis on the MAX-SAT Domain
A Hybrid Architecture Using Cross-Correlation and Recurrent Neural Networks for Acoustic Tracking in Robots
Representations for a Complex World: Combining Distributed and Localist Representations for Learning and Planning
Combining Visual Attention, Object Recognition and Associative Information Processing in a NeuroBotic System
Towards Word Semantics from Multi-modal Acoustico-Motor Integration: Application of the Bijama Model to the Setting of Action-Dependant Phonetic Representations
MaximumOne: An Anthropomorphic Arm with Bio-inspired Control System
The Intentional Attunement Hypothesis The Mirror Neuron System and Its Role in Interpersonal Relations
LARP, Biped Robotics Conceived as Human Modelling
Learning to Interpret Pointing Gestures: Experiments with Four-Legged Autonomous Robots
Reinforcement Learning Using a Grid Based Function Approximator
A Virtual Reality Platform for Modeling Cognitive Development
Sequence Detector Networks and Associative Learning of Grammatical Categories
A Scale Invariant Local Image Descriptor for Visual Homing
Biomimetic Neural Learning for Intelligent Robots - Intelligent Systems, Cognitive Robotics, and Neuroscience
Towards Biomimetic Neural Learning for Intelligent Robots
Detecting Sequences and Understanding Language with Neural Associative Memories and Cell Assemblies
Spatial Representation and Navigation in a Bio-inspired Robot
Modular Learning Schemes for Visual Robot Control
Neural Robot Detection in RoboCup
A Distributed Model of Spatial Visual Attention
Grounding Neural Robot Language in Action
A Spiking Neural Network Model of Multi-modal Language Processing of Robot Instructions
Novelty and Habituation: The Driving Forces in Early Stage Learning for Developmental Robotics
Image Invariant Robot Navigation Based on Self Organising Neural Place Codes
A Logical Framework for Modelling Breast Cancer Progression
Combinatorial Dynamics for Regulatory Networks
Temporal Logic Based Synthesis of Experimentally Constrained Interaction Networks
Verification for Everyone? An Overview of Dynamic Logic
Random Chromatin Neighborhoods in 2n=40 Mus m. domesticus Meiotic Cells: P-Percolation and Image Segmentation
Reactive Models for Biological Regulatory Networks
Oscillatory Behaviour on a Non-autonomous Hybrid SIR-Model
Molecular Logic: Brief Introduction and Some Philosophical Considerations
Molecular Logic and Computational Synthetic Biology - First International Symposium, MLCSB 2018, Santiago, Chile, December 17-18, 2018, Revised Selected Papers
On the Existence of Synergies and the Separability of Closed Reaction Networks
Analysis of Quantum Functions (Preliminary Version)
Decidability and Complexity of Tree Share Formulas
Parameterized Complexity of Safety of Threshold Automata
Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space
Rewrite Closure for Ground and Cancellative AC Theories
A Real-Time Interval Logic and Its Decision Procedure
Foundations of Software Technology and Theoretical Computer Science, 15th Conference, Bangalore, India, December 18-20, 1995, Proceedings
Proofs of Soundness and Proof Search (Invited Talk)
Approximation Algorithms for Union and Intersection Covering Problems
A Fast Algorithm for the Principle Partition of a Graph
Polymorphic Typing by Abstract Interpretation
Explicit Commutative ROABPs from Partial Derivatives
Visibly Linear Dynamic Logic
Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees
Replica Placement on Directed Acyclic Graphs
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, Chennai, India, December 15-18, 2010
Separating Regular Languages over Infinite Words with Respect to the Wagner Hierarchy
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
Approximating the Center Ranking Under Ulam
Hoare Logic for Mutual Recursion and Local Variables
Definable Operations On Weakly Recognizable Sets of Trees
On Measuring Average Case Complexity via Sum-Of-Squares Degree (Invited Talk)
Parameterized Complexity of Secluded Connectivity Problems
Covering Graphs with Few Complete Bipartite Subgraphs
Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in Presence of Obstacles
Implicit Temporal Query Languages: Towards Completeness
A Complete Axiomatisation for Timed Automata
An Incremental Bisimulation Algorithm
Towards a General Direct Product Testing Theorem
Analyzing the Implicit Computational Complexity of object-oriented programs
Constructing Large Matchings via Query Access to a Maximal Matching Oracle
Parityizing Rabin and Streett
Recursiveness over the Complex Numbers is Time-Bounded
One-way Functions and Isomorphism Conjecture
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings
Approximating Geometric Domains through Topological Triangulations
Inscribing or Circumscribing a Histogon to a Convex Polygon
A Limited-Backtrack Greedy Schema for Approximation Algorithms
Safely Composing Security Protocols
Robustly Separating the Arithmetic Monotone Hierarchy via Graph Inner-Product
Almost Optimal Strategies in One Clock Priced Timed Games
Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints
Comparing Infinitary Systems for Linear Logic with Fixed Points
Some Sieving Algorithms for Lattice Problems
The Number of Crossing Free Configurations on Finite Point Sets in the Plane
CCS, Location and Asynchronous Transition Systems
Irreducible Polynomials over Finite Fields
Failures Semantics for a Simple Process Language with Refinement
Fast Allocation and Deallocation with an Improved Buddy System
The Complexity of Tree Transducer Output Languages
Behavioral Metrics via Functor Lifting
Eliminating Cascading Rollback in Structured Database
A Characterization of Spartan Graphs and New Lower Bounds for Eternal Vertex Cover
Counter Machines with Infrequent Reversals
Homomorphism Problems for First-Order Definable Structures
Connected Search for a Lazy Robber
Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract)
Renaming is Necessary in Timed Regular Expressions
Minimizing Weighted lp-Norm of Flow-Time in the Rejection Model
Improved Quantum Query Upper Bounds Based on Classical Decision Trees
The Parallel Dynamic Complexity of the Abelian Cayley Group Membership Problem
Lazy pattern matching in the ML language
Trace Consistency and Inevitablity
Modal Logics Definable by Universal Three-Variable Formulas
A Kleene Iteration for Parallelism
Transforming Password Protocols to Compose
Panel on Software Technology: Integrating Theory and Practice
Approximation Algorithms for Planar Matching
Decidable classes of documents for XPath
Synchronization of Deterministic Visibly Push-Down Automata
Process Symmetry in Probabilistic Transducers
Reasons for Hardness in QBF Proof Systems
Query Preserving Watermarking Schemes for Locally Treelike Databases
LZ77 Factorisation of Trees
Relativized Arthur-Merlin versus Merlin-Arthur Games
Progress in Lifting and Applications in Lower Bounds (Invited Talk)
Fragments of Fixpoint Logic on Data Words
Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS
On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees
A Tight Lower Bound for Streett Complementation
Mean-Payoff Games on Timed Automata
Adaptive Stabilization of Reactive Protocols
Saturation of Concurrent Collapsible Pushdown Systems
Flavors of Quantifiers in Hyperlogics
Composing Strand Spaces
Proving Non-Reachabililty by Modulo-Place-Invariants
On the Mean Weight Balance Factor of Binary Trees
The Power of Reachability Testing for Timed Automata
Localities and Failures (Extended Abstract)
Genome Halving Problem Revisited
Taming the Complexity of Timeline-Based Planning over Dense Temporal Domains
Annotated Program Transformations
Towards Identity Testing for Sums of Products of Read-Once and Multilinear Bounded-Read Formulae
One-Way Functions and a Conditional Variant of MKTP
Finding Small Dijoins in Transitive Closure Time
Finding Pseudorandom Colorings of Pseudorandom Graphs
The Parameter Space of the d -step Conjecture
Treating Terminals as Function Values of Time
The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata
Synthesis of Privacy-Preserving Systems
Low-Latency Sliding Window Algorithms for Formal Languages
Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem
A Fine-grained Analysis of a Simple Independent Set Algorithm
Vertex Exponential Algorithms for Connected f-Factors
Consistency of Injective Tree Patterns
One-way Definability of Sweeping Transducer
All-Pairs Min-Cut in Sparse Networks
Foundations of Software Technology and Theoretical Computer Science, Sixth Conference, New Delhi, India, December 18-20, 1986, Proceedings
On the Parameterised Complexity of String Morphism Problems
Querying Best Paths in Graph Databases
Robust Positivity Problems for Linear Recurrence Sequences: The Frontiers of Decidability for Explicitly Given Neighbourhoods
Padding, Commitment and Self-reducability
The Transformation Calculus
Real-Counter Automata and Their Decision Problems
Lift & Project Systems Performing on the Partial Vertex Cover Polytope
Fighting bit Rot with Types (Experience Report: Scala Collections)
Dynamic programming in faulty memory hierarchies (cache-obliviously)
Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments
Minimal Disclosure in Partially Observable Markov Decision Processes
Random Testing for Distributed Systems with Theoretical Guarantees (Invited Paper)
An effective characterization of the alternation hierarchy in two-variable logic
Algorithmic Issues in Coding Theory
Shared-Variable Concurrency: A Proposal
On Proving Communication Closedness of Distributed Layers
Is BP.+ P a Probabilistic Class?
Parameterised Pushdown Systems with Non-Atomic Writes
Relating the Degree of Ambiguity of Finite Automata to the Succinctness of their Representation
Subquadratic Algorithms for Workload-Aware Haar Wavelet Synopses
Foundations of Software Technology and Theoretical Computer Science, Seventh Conference, Pune, India, December 17-19, 1987, Proceedings
Global Model Checking of Ordered Multi-Pushdown Systems
Universal and Representative Instances Using Unmarked Nulls
Program Simplification via Symbolic Interpretation
The Bounded Weak Monadic Quantifier Alternation Hierarchy of Equational Graphs Is Infinite
Specification = Program + Types
Complexity Issues for Vacillatory Function Identification
Primality Testing with Gaussian Periods
On Correcting Inputs: Inverse Optimization for Online Structured Prediction
Continuous-Time Stochastic Games with Time-Bounded Reachability
The Adwords Problem with Strict Capacity Constraints
Computing Hierarchies of Clusters from the Euclidean Minimum Spanning Tree in Linear Time
Reachability of Hennessy-Milner Properties for Weakly Extended PRS
Analysis of Preflow Push Algorithms for Maximum Network Flow
Semantics of Distributed Horn Clause Programs
State Space Reductions for Alternating Büchi Automata
Graph Pattern Polynomials
Greibach Normal Form for omega-Algebraic Systems and Weighted Simple omega-Pushdown Automata
Additive, Near-Additive, and Multiplicative Approximations for APSP in Weighted Undirected Graphs: Trade-Offs and Algorithms
Improved Bounds for Covering General Polygons with Rectangles
Randomized and Quantum Query Complexities of Finding a King in a Tournament
Rerouting shortest paths in planar graphs
Distributed Games with a Central Decision Maker
Accumulators: A New Logic Variable Abstractions for Functional Languages
A Generalization of Backus' FP
The Gallina Specification language: A Case Study
A New Method for Undecidability Proofs of First Order Theories
Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets
Nash Equilibria in Concurrent Games with Büchi Objectives
Classification Among Hidden Markov Models
Time Analysis, Cost Equivalence and Program Refinement
A Natural Semantics for Logic Programs with Negation
Branching Pushdown Tree Automata
Diagrammatic Polyhedral Algebra
An Algorithm for Reducing Binary Branchings
Conditional Reactive Systems
Evaluation is MSOL-compatible
ICSP and Its Relationship with ACSP and CSP
The DAG Visit Approach for Pebbling and I/O Lower Bounds
Finger Search in Grammar-Compressed Strings
44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2024, Gandhinagar, Gujarat, India, December 16-18, 2024
Colored Cut Games
Aperiodicity of Rational Functions Is PSPACE-Complete
Separating Cook Completeness from Karp-Levin Completeness Under a Worst-Case Hardness Hypothesis
Connecting Vertices by Independent Trees
3-connected Planar Graph Isomorphism is in Log-space
Algorithms for Uncertain Environments: Going Beyond the Worst-Case (Invited Talk)
Approximately Interpolating Between Uniformly and Non-Uniformly Polynomial Kernels
Determinizing Büchi Asnchronous Automata
The Expressibility of Nondeterministic Auxiliary Stack Automata and its Relation to Treesize Bounded Alternating Auxiliary Pushdown Automata
The Structure and Complexity of Minimal NFA's over a Unary Alphabet
Cubicity, Degeneracy, and Crossing Number
On the Sensitivity of Shape Fitting Problems
A Two-Level Logic Approach to Reasoning About Typed Specification Languages
The Priority k -Median Problem
42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, IIT Madras, Chennai, India, December 18-20, 2022
Playing (Almost-)Optimally in Concurrent Büchi and Co-Büchi Games
Higher-Order Proof by Consistency
Playing in stochastic environment: from multi-armed bandits to two-player games
The Receptive Distributed pi-Calculus (Extended Abstract)
Proofs of Termination of Rewrite Systems for Polytime Functions
Encoding Generic Judgments
Petri Net Reachability Graphs: Decidability Status of FO Properties
Path Planning with Local Information
41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, Virtual Conference, December 15-17, 2021
The Complexity of the Inertia
The Wadge Hierarchy of Max-Regular Languages
Average-Case Analysis of the Modified Marmonic Algorithm
The Set Cover with Pairs Problem
Lower Bounds for Embedding Graphs into Graphs of Smaller Characteristic
Streaming for Aibohphobes: Longest Palindrome with Mismatches
Some Open Problems in Information-Theoretic Cryptography
An O(n^(1/4 +epsilon)) Space and Polynomial Algorithm for Grid Graph Reachability
New Bounds for the Garden-Hose Model
Descriptive Complexity and Model Checking
Better Boosting of Communication Oracles, or Not
An Automata-Theoretic Decision Procedure for Future Interval Logic
An Algebraic Framework to Reason About Concurrency (Invited Talk)
A Method to Check Knowledge Base Consistency
Uniform Circuits and Exclusive Read PRAMs
Synthesizing Different Development Paradigms: Combining Top-Down with Bottom-Up Reasoning About Distributed Systems
Functionally Private Approximations of Negligibly-Biased Estimators
Communication Lower Bounds Via the Chromatic Number
Contracting Planar Graphs Efficiency in Parallel
Prompt Delay
Analyzing Asynchronous Programs with Preemption
Knapsack Cover Subject to a Matroid Constraint
Deriving Object Octree from Images
A Near-linear Time Constant Factor Algorithm for Unsplittable Flow Problem on Line with Bag Constraints
Non-cancellative Boolean Circuits: A Generalization of Monotone Boolean Circuits
Vertex Deletion Problems on Chordal Graphs
An Optimal Parallel Algorithm for Dynamic Expression Evaluation and Its Applications
A Near Optimal Algorithm for the Extended Cow-Path Problem in the Presence of Relative Errors
Minimising Good-For-Games Automata Is NP-Complete
Randomness Efficient Noise Stability and Generalized Small Bias Sets
Unreliability in Practical Subclasses of Communicating Systems
On Approximation Schemes for Stabbing Rectilinear Polygons
The Complexity of Compositions of Deterministic Tree Transducers
Who is Pointing When to Whom?
A Resolution Rule for Well-Formed Formulae
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time
On the Bisimulation Invariant Fragment of Monadic S1 in the Finite
A Theorem on the Approximation of Set Cover and Vertex Cover
On Colourability of Polygon Visibility Graphs
Some Results About Logical Descriptions of Non-Deterministic Behaviours
A Parallel Approximation Algorithm for Minimum Weight Triangulation
When You Come at the King You Best Not Miss
Alternation in Equational Tree Automata Modulo XOR
Dynamically Ordered Probabilistic Choice Logic Programming
Quantitative Models and Implicit Complexity
Compilation and Equivalence of Imperative Objects
NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching
On the Complexity of Parameterized Reachability in Reconfigurable Broadcast Networks
On Classical Decidable Logics Extended with Percentage Quantifiers and Arithmetics
Label-Selective lambda-Calculus Syntax and Confluence
Extending EFX Allocations to Further Multi-Graph Classes
A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles
Replica Placement via Capacitated Vertex Cover
Achilles and the Tortoise Climbing Up the Arithmetical Hierarchy
Approximate Trace Reconstruction via Median String (In Average-Case)
Proving Lower Bounds Via Pseudo-random Generators
Efficient Algorithms for Abelian Group Isomorphism and Related Problems
The Frobenius Problem
Efficient Resolution of Singularities of Plane Curves