yusuke1997/dblp-id-title huggingface dataset:
Winner Determination Algorithms for Graph Games with Matching Structures
Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space
Approximating Spanning Tree Congestion on Graphs with Polylog Degree
On the Complexity of Computing Treebreadth
Stable Sets of Threshold-Based Cascades on the Erdős-Rényi Random Graphs
Maximum Clique Exhaustive Search in Circulant k-Hypergraphs
Monotone Partitions of Simple Polygons
Acyclic Colorings of Graph Subdivisions
Computing Primitively-Rooted Squares and Runs in Partial Words
A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras
Monotone Paths in Geometric Triangulations
Learning from Positive and Negative Examples: Dichotomies and Parameterized Algorithms
Heuristic, Branch-and-Bound Solver and Improved Space Reduction for the Median of Permutations Problem
Orientations of 1-Factors and the List Edge Coloring Conjecture
Timeline Cover in Temporal Graphs: Exact and Approximation Algorithms
Edge-Simple Circuits through 10 Ordered Vertices in Square Grids
Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers
Faster Computation of Path-Width
On Some Properties of Doughnut Graphs
Path-Based Supports for Hypergraphs
Harmless Sets in Sparse Classes
Guarding Terrains with Guards on a Line
Bipartite Graphs of Large Clique-Width
New Word-Based Adaptive Dense Compressors
Dynamising Interval Scheduling: The Monotonic Case
Linear Time Construction of Indexable Elastic Founder Graphs
Polynomial Time Algorithms for Tracking Path Problems
Worst Case Efficient Single and Multiple String Matching in the RAM Model
Lossless Seeds for Searching Short Patterns with High Error Rates
Letter Graphs and Geometric Grid Classes of Permutations: Characterization and Recognition
A Faster Implementation of Online Run-Length Burrows-Wheeler Transform
Faster Coreset Construction for Projective Clustering via Low-Rank Approximation
On Conditional Covering Problem
Structural Properties of Subdivided-Line Graphs
Universal Cycles for Weight-Range Binary Strings
Guarding a 1.5D Terrain with Imprecise Viewpoints
2-Layer Right Angle Crossing Drawings
About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings
Combinatorial Questions: How Can Graph Labelling Help?
A Catalogue of Algorithms for Building Weak Heaps
Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles
A Hamilton Cycle in the k-Sided Pancake Network
Non-preemptive Tree Packing
On the Oriented Coloring of the Disjoint Union of Graphs
Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23-25, 2019, Proceedings
How to Design Graphs with Low Forwarding Index and Limited Number of Edges
Plane Bichromatic Trees of Low Degree
The Bottom-Left Algorithm for the Strip Packing Problem
Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers
Domino Tatami Covering Is NP-Complete
Notes on generating completely condensed d-neighborhoods
GRP_CH Heuristic for Generating Random Simple Polygon
Combinatorics and Algorithms for Quasi-chain Graphs
An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs
A Partition Approach to Lower Bounds for Zero-Visibility Cops and Robber
Maximum Order of a Planar Oclique Is 15
On Maximum Common Subgraph Problems in Series-Parallel Graphs
K t Minors in Large t -Connected Graphs
The Height and Range of Watermelons without Wall
Complexity Dichotomies for the Minimum ℱ -Overlay Problem
Finding Perfect Matching Cuts Faster
Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem
Optimal Cost-Based Allocations Under Two-Sided Preferences
Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems
Evaluation of Tie-Breaking and Parameter Ordering for the IPO Family of Algorithms Used in Covering Array Generation
Note on Decomposition of K n , n into (0, j )-prisms
Simpler Parameterized Algorithm for OCT
On the Maximal Sum of Exponents of Runsin a String
Computing Heat Kernel Pagerank and a Local Clustering Algorithm
Minimum r-Star Cover of Class-3 Orthogonal Polygons
On Solving Simple Curved Nonograms
Budget-Constrained Cost-Covering Job Assignment for a Total Contribution-Maximizing Platform
A Faster FPTAS for the Unbounded Knapsack Problem
Deciding Representability of Sets of Words of Equal Length in Polynomial Time
On Solving the Queen Graph Coloring Problem
On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths
A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs
Incremental Algorithm for Minimum Cut and Edge Connectivity in Hypergraph
Polar Permutation Graphs
Recent Advances of Palindromic Factorization
Boundary-to-Boundary Flows in Planar Graphs
The Closed Geodetic Game: Algorithms and Strategies
Extending Simple Monotone Drawings
Tight Bound on the Diameter of the Knödel Graph
Combinatorial Models for Cooperation Networks
Upper and Lower I/O Bounds for Pebbling r -Pyramids
Linear Time Algorithms for Happy Vertex Coloring Problems for Trees
Design and Analysis of a Tree-Backtracking Algorithm for Multiset and Pure Permutations
On Computing the Total Displacement Number via Weighted Motzkin Paths
Combinatorial Properties of Full-Flag Johnson Graphs
Königsberg Sightseeing: Eulerian Walks in Temporal Graphs
Cluster Editing with Locally Bounded Modifications Revisited
Space Efficient Data Structures for Nearest Larger Neighbor
A Polyhedral Perspective on Tropical Convolutions
Schröder Partitions and Schröder Tableaux
Parameterized Complexity of (A, ℓ )-Path Packing
Hamilton Cycles in Restricted Rotator Graphs
Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs
Computing Role Assignments of Proper Interval Graphs in Polynomial Time
Bicluster Editing with Overlaps: A Vertex Splitting Approach
Prefix Table Construction and Conversion
Computing the Rooted Triplet Distance Between Phylogenetic Networks
Designing good random walks on finite graphs
Computing Abelian String Regularities Based on RLE
Perfect Matching Cuts Partitioning a Graph into Complementary Subgraphs
Hardness of Balanced Mobiles
Quasi-Cyclic Codes over $\mathbb{F}_{13}$
Tile-Based Knot Assembly with Celtic!
A Linear Delay Algorithm of Enumerating Strongly-Connected Induced Subgraphs Based on SSD Set System
Faster Replacement Paths Algorithm for Undirected, Positive Integer Weighted Graphs with Small Diameter
Single Parameter FPT-Algorithms for Non-trivial Games
Longest Common Extensions in Partial Words
Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings
On Erdős-Szekeres-Type Problems for k-convex Point Sets
Embedding Circulant Networks into Butterfly and Benes Networks
Computing Maximal Palindromes in Non-standard Matching Models
On Counting Range Maxima Points in Plane
Infinite Random Geometric Graphs from the Hexagonal Metric
Dual Domination
Minimum-Complexity Graph Simplification Under the Fréchet-Like Distance
Linear Ramsey Numbers
Acyclic Coloring with Few Division Vertices
Parameterized Complexity of Min-Power Asymmetric Connectivity
Evangelism in Social Networks
Edge Exploration of Temporal Graphs
Covering Convex Polygons by Two Congruent Disks
Profile-Based Optimal Matchings in the Student/Project Allocation Problem
Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers
Fully Decomposable Split Graphs
Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism
On Irreducibility of Maximal Cliques
Acyclic Matching in Some Subclasses of Graphs
Directed Path Partition Problem on Directed Acyclic Graphs
Deterministic Algorithms for the Independent Feedback Vertex Set Problem
Complexity of Cycle Transverse Matching Problems
Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology
Saving on Phases: Parameterized Approximation for Total Vertex Cover
An FPT Certifying Algorithm for the Vertex-Deletion Problem
The Hamiltonian Cycle Problem and Monotone Classes
Weighted LCS
Solving Matching Problems Efficiently in Bipartite Graphs
On the Existence of EFX Allocations
Computing a Longest Common Palindromic Subsequence
On the Steiner Radial Number of Graphs
A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-Connected Induced Subgraphs
Zero-Suppression and Computation Models
A Fast Scaling Algorithm for the Weighted Triangle-Free 2-Matching Problem
Collision-Free Routing Problem with Restricted L-Path
Computing the Center of Uncertain Points on Cactus Graphs
Algorithms for Constructing Anonymizing Arrays
Study of \kappa (D) for D = 2, 3, x, y
Better Polynomial Algorithms on Graphs of Bounded Rank-Width
LZ-ABT: A Practical Algorithm for α-Balanced Grammar Compression
Between Proper and Strong Edge-Colorings of Subcubic Graphs
Sequence Covering Arrays and Linear Extensions
An Improved Bound for Equitable Proper Labellings
Linear Algorithms for Red and Blue Domination in Convex Bipartite Graphs
Vector Spaces of Graphs Closed Under Isomorphism
Dynamic Subtrees Queries Revisited: The Depth First Tour Tree
Collision-Free Routing in Sink-Centric Sensor Networks with Coarse-Grain Coordinates
Proceedings of the 19th International Workshop on Combinatorial Algorithms, IWOCA 2008, September 13-15, 2008, Nagoya, Japan
New Approximation Algorithms for the Vertex Cover Problem
Backtrack Search for Parallelisms of Projective Spaces
Succinct Representation of Linear Extensions via MDDs and Its Application to Scheduling Under Precedence Constraints
Finding Cactus Roots in Polynomial Time
Lower Bounds for Restricted Schemes in the Two-Adaptive Bitprobe Model
Equitable d-degenerate Choosability of Graphs
Parameterized Upper Bounds for Path-Consistent Hub Labeling
A New Algorithm for Efficient Pattern Matching with Swaps
Graph Parameters and Ramsey Theory
Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers
Border Array for Structural Strings
Quantifying Privacy: A Novel Entropy-Based Measure of Disclosure Risk
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes
Dominance for Enclosure Problems
Minimizing Distances Between Vertices and Edges Through Tree t-Spanners
Evaluation of Recoverable-Robust Timetables on Tree Networks
Weighted Group Search on the Disk and Improved LP-Based Lower Bounds for Priority Evacuation
Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes
A Construction for 0, 1, -1 Orthogonal Matrices Visualized
Maximizing Minimum Cycle Bases Intersection
All Subgraphs of a Wheel Are 5-Coupled-Choosable
Connected Feedback VertexSet on AT-Free Graphs
Card-Based Cryptographic Protocols for Three-Input Functions Using Private Operations
A Triangle Process on Regular Graphs
Shortest-Path-Preserving Rounding
A Boundary Property for Upper Domination
Pattern Matching for k-Track Permutations
Improving Online Bin Covering with Little Advice
An FPT Algorithm for Matching Cut and d-Cut
Incomparability Graphs of Lattices II
Streaming Algorithms for Scheduling Jobs with Priorities
Branching Systems
Exact Algorithms for Weak Roman Domination
Maximum st-Flow in Directed Planar Graphs via Shortest Paths
The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree
The k-Leaf Spanning Tree Problem Admits a Klam Value of 39
A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs
Skip Lift: A Probabilistic Alternative to Red-Black Trees
Combinatorial Algorithms and Methods for Security of Statistical Databases Related to the Work of Mirka Miller
Two Constant-Factor-Optimal Realizations of Adaptive Heapsort
Practical Space-Efficient Index for Structural Pattern Matching
On the Parameterized Complexity of Happy Vertex Coloring
A Unifying Property for Distribution-Sensitive Priority Queues
Computing Longest (Common) Lyndon Subsequences
Complexity of Locally Injective Homomorphism to the Theta Graphs
Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges
Relaxed and Approximate Graph Realizations
Delivering multimedia content in vehicular ad hoc networks
On Computing Sets of Integers with Maximum Number of Pairs Summing to Powers of 2
Recognition of Probe Ptolemaic Graphs - (Extended Abstract)
On the Intractability Landscape of Digraph Intersection Representations
The Rand and Block Distances of Pairs of Set Partitions
Branch-and-Bound Algorithm for Symmetric Travelling Salesman Problem
Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently
Upper Domination: Complexity and Approximation
Online Chromatic Number is PSPACE-Complete
Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution
Forbidden Subgraph Colorings and the Oriented Chromatic Number
A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences
On Maximal Chain Subgraphs and Covers of Bipartite Graphs
Partial Covering Arrays: Algorithms and Asymptotics
Search for Combinatorial Objects Using Lattice Algorithms - Revisited
Reconfiguration of Vertex Covers in a Graph
L(2, 1)-labellings of integer distance graphs
Resolving Unresolved Resolved and Unresolved Triplets Consistency Problems
The Parameterized Complexity of s-Club with Triangle and Seed Constraints
On Relative Clique Number of Triangle-Free Planar Colored Mixed Graphs
Automata approach to graphs of bounded rank-width
On the Maximal Number of Cubic Subwords in a String
Improved Analysis of Two Algorithms for Min-Weighted Sum Bin Packing
Call Admission Problems on Trees with Advice - (Extended Abstract)
Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem
Combinatorial Algorithms - 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers
New Bounds for Maximizing Revenue in Online Dial-a-Ride
Enumerating Tatami Mat Arrangements of Square Grids
Some Hamiltonian Properties of One-Conflict Graphs
The Parameterized Complexity of Happy Colorings
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism
Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
Parameterized Algorithms for Power Edge Set and Zero Forcing Set
Polynomial Kernels for 3-Leaf Power Graph Modification Problems
Domino Graphs and the Decipherability of Directed Figure Codes
A Graph Radio k -Coloring Algorithm
Efficient Lagrangian Heuristics for the Two-Stage Flow Shop with Job Dependent Buffer Requirements
How to Answer a Small Batch of RMQs or LCA Queries in Practice
Composed Degree-Distance Realizations of Graphs
Algorithmic Aspects of Dominator Colorings in Graphs
The Complexity of the Identifying Code Problem in Restricted Graph Classes
Blocks of Hypergraphs - Applied to Hypergraphs and Outerplanarity
Fully Leafed Induced Subtrees
On Minimizing the Number of Label Transitions around a Vertex of a Planar Graph
A Multi-start Heuristic for Multiplicative Depth Minimization of Boolean Circuits
The Micro-world of Cographs
The Hull Number in the Convexity of Induced Paths of Order 3
Verification Problem of Maximal Points under Uncertainty
Limiting Distribution for Distances in k -Trees
Linear Ordering Based MIP Formulations for the Vertex Separation or Pathwidth Problem
A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints
An Efficient Algorithm for the Proximity Connected Two Center Problem
A Note on Handicap Incomplete Tournaments
On Approximation Complexity of Metric Dimension Problem
Computing Asymmetric Median Tree of Two Trees via Better Bipartite Matching Algorithm
Partial Information Network Queries
Disjoint Paths and Connected Subgraphs for H-Free Graphs
Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three
Improved Lower Bound on Broadcast Function Based on Graph Partition
A Family of Tree-Based Generators for Bubbles in Directed Graphs
Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory
Periods in Partial Words: An Algorithm
Minimizing ℓ 2 Norm of Flow Time by Starvation Mitigation
Algorithms and Complexity of s-Club Cluster Vertex Deletion
The Steiner Problem for Count Matroids
Complexity and Algorithms for MUL-Tree Pruning
An Optimal Algorithm for Computing All Subtree Repeats in Trees
K-Phase Oscillator Synchronization for Graph Coloring
Permanent of Bipartite Graphs in Terms of Determinants
On the Power Domination Number of de Bruijn and Kautz Digraphs
Range Median of Minima Queries, Super-Cartesian Trees, and Text Indexing
Bounded Degree Group Steiner Tree Problems
Tukey Depth Histograms
Multiset, Set and Numerically Decipherable Codes over Directed Figures
p-Suffix Sorting as Arithmetic Coding
Enumerating Cyclic Orientations of a Graph
On the Complexity of Stackelberg Matroid Pricing Problems
On the Zero Forcing Number of Bijection Graphs
Perfect Matchings with Crossings
Dictionary-Symbolwise Flexible Parsing
Sufficient Condition for { C 4 , C 2 t } - Decomposition of K 2 m , 2 n - An Improved Bound
How Far From a Worst Solution a Random Solution of a kCSP Instance Can Be?
Holes in 2-Convex Point Sets
Degree Sequences of PageRank Uniform Graphs and Digraphs with Prime Outdegrees
SOBRA - Shielding Optimization for BRAchytherapy
Approximation Bounds on the Number of Mixedcast Rounds in Wireless Ad-Hoc Networks
Complexity of the Cop and Robber Guarding Game
Succinct Representations of Trees
Covering Vertices by 4 + -Paths: A Simpler Local Search Coupled with a More Delicate Amortization
Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams
The Guarding Problem - Complexity and Approximation
Bimagic Labelings
Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures
The Minimum Algorithm Size of k-Grouping by Silent Oblivious Robots
Weak Heaps and Friends: Recent Developments
Combinatorial Algorithms, 23rd International Workshop, IWOCA 2012, Tamil Nadu, India, July 19-21, 2012, Revised Selected Papers
On the Approximability of Splitting-SAT in 2-CNF Horn Formulas
1-Page and 2-Page Drawings with Bounded Number of Crossings per Edge
The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs
Speeding up Graph Algorithms via Switching Classes
Cosecure Domination: Hardness Results and Algorithms
Online Knapsack with Removal and Recourse
An Efficient Noisy Binary Search in Graphs via Median Approximation
Graphs of Separability at Most Two: Structural Characterizations and Their Consequences
Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism
Regular Language Constrained Sequence Alignment Revisited
Modelling Heterogeneity in Multi Agent Systems
From Lens to Flow Structure
The GlobData Fault-Tolerant Replicated Distributed Object Database
Considerations for Using Domain-Specific Modeling in the Analysis Phase of Software Development Process
On the Use of New Technologies in Health Care
A Handoff Priority Scheme for TDMA/FDMA-Based Cellular Networks
On Delay Times in a Bluetooth Piconet: The Impact of Different Scheduling Policies
FPGA Implementation of Digital Chaotic Cryptography
Neural Network Based Algorithms for IP Lookup and Packet Classification
A Distributed Low-Cost Dynamic Multicast Routing Algorithm with Delay Constraints
A Mobile System for Extracting and Visualizing Protein-Protein Interactions
B2B Integration - Aligning ebXML and Ontology Approaches
A Genetic Algorithm for Steiner Tree Optimization with Multiple Constraints Using Prüfer Number
Using a Real-Time Web-Based Pattern Recognition System to Search for Component Patterns Database
An Adaptive Flow Control Scheme for Improving TCP Performance in Wireless Internet
Sequential Consistency as Lazy Linearizability
A Memory Copy Reduction Scheme for Networked Multimedia Service in Linux Kernel
Priority Vantage Points Structures for Similarity Queries in Metric Spaces
Mobile Agent-Based Misuse Intrusion Detection Rule Propagation Model for Distributed System
An Efficient Method for Controlling Access in Object-Oriented Databases
A Framework for Agent-Based Software Development
Design and Implementation of Application-Level Multicasting Services over ATM Networks
The Class Cohesion Using the Reference Graph G1 and G2
A Dynamic Window-Based Approximate Shortest Path Re-computation Method for Digital Road Map Databases in Mobile Environments
H-Colorings of Large Degree Graphs
Web-Based Process Control Systems: Architectural Patterns, Data Models, and Services
A Levelized Schema Extraction for XML Document Using User-Defined Graphs
A Dynamic Backoff Scheme to Guarantee QoS over IEEE 802.11 Wireless Local Area Networks
Different Local Search Algorithms in STAGE for Solving Bin Packing Problem
Image Segmentation Based on Shape Space Modeling
A New Technique for Participation of Non-CORBA Independent Persistent Objects in OTS Transactions
Location Management Using Multicasting HLR in Mobile Networks
Discovering Local Patterns from Multiple Temporal Sequences
A New Scheme Based on Semiconductor Lasers with Phase-Conjugate Feedback for Cryptographic Communications
An Agent Based Service Discovery Architecture for Mobile Environments
An Adaptive TCP Protocol for Lossy Mobile Environment
Transmission Time Analysis of WAP over CDMA System Using Turbo Code Scheme
EurAsia-ICT 2002: Information and Communication Technology, First EurAsian Conference, Shiraz, Iran, October 29-31, 2002, Proceedings
Adaptive Application-Centric Management in Meta-computing Environments
A QoS Provision Architecture for Mobile IPv6 over MPLS Using HMAT
Flexible Modification of Relational Schema by X2RMap in Storing XML into Relations
Evolution of Cooperation in Multiagent Systems
Application of Agent Technologies in Extended Enterprise Production Planning
Secure Bluetooth Piconet Using Non-anonymous Group Key
The Geometric Framework for Exact and Similarity Querying XML Data
HERMES: File System Support for Multimedia Streaming in Information Home Appliance
Strategie Tool for Assessment of the Supply and Demand Relationship between ASPs and SMEs for Competitive Advantage
Compositional Modelling of Workflow Processes
A Secure Mobile Agent System Applying Identity-Based Digital Signature Scheme
A High Performance Image Coding Using Uniform Morphological Sampling, Residues Classifying, and Vector Quantization
An Intelligent System for Therapy Control in a Distributed Organization
Parallel Algorithm and Architecture for Public-Key Cryptosystem
Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme
Dynamic System Simulation on the Web
A New Bandwidth Reduction Method for Distributed Rendering Systems
Mapping XML-Schema to Relational Schema
Call Admission Control in Cellular Mobile Networks: A Learning Automata Approach
Bon: The Persian Stemmer
An Integrated Programming Environment for Teaching the Object-Oriented Programming Paradigm
Non-linear Prediction of Speech Signal Using Artificial Neural Nets
EDMIS: Metadata Interchange System for OLAP
Embedding Full Ternary Trees into Recursive Circulants
A Study of Marking Aggregated TCP and UDP Flows Using Generalized Marking Scheme
Intelligent Paging Strategy in 3G Personal Communication Systems
Monte Carlo Soft Handoff Modeling
ADML: A Language for Automatic Generation of Migration Plans
Experience from Mobile Application Service Framework in WIP
Hidden Markov Model and Neural Network Hybrid
Development of UML Descriptions with USE
Extracting Information from XML Documents by Reverse Generating a DTD
A New Boundary Matching Algorithm Based on Edge Detection
A Prototype for Functionality Based Network Management System
Performing IP Lookup on Very High Line Speed
Extracting, Interconnecting, and Accessing Heterogeneous Data Sources: An XML Query Based Approach
Storage and Querying of High Dimensional Sparsely Populated Data in Compressed Representation
The Current Legislation Covering E-learning Provisions for the Visually Impaired in the EU
Speaker Model and Decision Threshold Updating in Speaker Verification