Hsu-Chun Yen

According to our database1, Hsu-Chun Yen authored at least 144 papers between 1985 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
On Contact Representations of Directed Planar Graphs.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017
A Position-Aware Language Modeling Framework for Extractive Broadcast News Speech Summarization.
ACM Trans. Asian & Low-Resource Lang. Inf. Process., 2017

On Number of Tags Estimation in RFID Systems.
IEEE Systems Journal, 2017

QoS/QoE Support for H.264/AVC Video Stream in IEEE 802.11ac WLANs.
IEEE Systems Journal, 2017

Area-universal drawings of biconnected outerplane graphs.
Inf. Process. Lett., 2017

Improved Algorithms for Grid-Unfolding Orthogonal Polyhedra.
Int. J. Comput. Geometry Appl., 2017

On orthogonally convex drawings of plane graphs.
Comput. Geom., 2017

On Bend-Minimized Orthogonal Drawings of Planar 3-Graphs.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Unfolding Some Classes of Orthogonal Polyhedra of Arbitrary Genus.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016
V2V QoS Guaranteed Channel Access in IEEE 802.11p VANETs.
IEEE Trans. Dependable Sec. Comput., 2016

Drawing Clustered Graphs Using Stress Majorization and Force-Directed Placements.
Proceedings of the 20th International Conference Information Visualisation, 2016

Exploring Word Mover's Distance and Semantic-Aware Embedding Techniques for Extractive Broadcast News Summarization.
Proceedings of the Interspeech 2016, 2016

Petri Nets and Semilinear Sets (Extended Abstract).
Proceedings of the Theoretical Aspects of Computing - ICTAC 2016, 2016

Exploiting graph regularized nonnegative matrix factorization for extractive speech summarization.
Proceedings of the Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, 2016

2015
A Pragmatic VBR Stream Scheduling Policy for IEEE 802.11e HCCA Access Method.
IEEE Trans. Emerging Topics Comput., 2015

Constrained floorplans in 2D and 3D.
Theor. Comput. Sci., 2015

Combining Relevance Language Modeling and Clarity Measure for Extractive Speech Summarization.
IEEE/ACM Trans. Audio, Speech & Language Processing, 2015

A New Approach for Contact Graph Representations and Its Applications.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Designing and Annotating Metro Maps with Loop Lines.
Proceedings of the 19th International Conference on Information Visualisation, 2015

Unfolding Orthogonal Polyhedra with Linear Refinement.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Positional language modeling for extractive broadcast news speech summarization.
Proceedings of the INTERSPEECH 2015, 2015

Low ply graph drawing.
Proceedings of the 6th International Conference on Information, 2015

Incorporating proximity information in relevance language modeling for extractive speech summarization.
Proceedings of the Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, 2015

2014
Enhanced language modeling for extractive speech summarization with sentence relatedness information.
Proceedings of the INTERSPEECH 2014, 2014

Effective pseudo-relevance feedback for language modeling in extractive speech summarization.
Proceedings of the IEEE International Conference on Acoustics, 2014

Rectilinear Duals Using Monotone Staircase Polygons.
Proceedings of the Combinatorial Optimization and Applications, 2014

A margin-based discriminative modeling approach for extractive speech summarization.
Proceedings of the Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, 2014

2013
Preface.
Int. J. Found. Comput. Sci., 2013

Spatially Efficient Design of Annotated Metro Maps.
Comput. Graph. Forum, 2013

Voronoi-Based Label Placement for Metro Maps.
Proceedings of the 17th International Conference on Information Visualisation, 2013

On Orthogonally Convex Drawings of Plane Graphs - (Extended Abstract).
Proceedings of the Graph Drawing - 21st International Symposium, 2013

2012
A new force-directed graph drawing method based on edge-edge repulsion.
J. Vis. Lang. Comput., 2012

On the containment and equivalence problems for two-way transducers.
Theor. Comput. Sci., 2012

Travel-Route-Centered Metro Map Layout and Annotation.
Comput. Graph. Forum, 2012

2011
Complexity analysis of balloon drawing for rooted trees.
Theor. Comput. Sci., 2011

Mental map preserving graph drawing using simulated annealing.
Inf. Sci., 2011

On Almost-Sure Properties of Probabilistic Discrete Event Systems.
Fundam. Inform., 2011

Optimized Topological Surgery for Unfolding 3D Meshes.
Comput. Graph. Forum, 2011

A Zone-Based Approach for Placing Annotation Labels on Metro Maps.
Proceedings of the Smart Graphics - 11th International Symposium, 2011

On Two-Way Transducers.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

One-and-a-Half-Side Boundary Labeling.
Proceedings of the Combinatorial Optimization and Applications, 2011

2010
On decision problems for parameterized machines.
Theor. Comput. Sci., 2010

Preface.
Int. J. Found. Comput. Sci., 2010

Complexity Analysis of Balloon Drawing for Rooted Trees
CoRR, 2010

Reachability Analysis of Augmented Marked Graphs via Integer Linear Programming.
Comput. J., 2010

On almost-sure properties of probabilistic discrete event systems.
Proceedings of the 10th International Workshop on Discrete Event Systems, 2010

Gaussian Distributive Filtering in Histogram Equalization.
Proceedings of the Fifth International Conference on Broadband and Wireless Computing, 2010

2009
Drawing graphs with nonuniform nodes using potential fields.
J. Vis. Lang. Comput., 2009

On minimal elements of upward-closed sets.
Theor. Comput. Sci., 2009

Path Decomposition and Semilinearity of Petri Nets.
Int. J. Found. Comput. Sci., 2009

Reachability Analysis of Variants of Communication-Free Petri Nets.
IEICE Transactions, 2009

Alignment-based surface patterns for factoid question answering systems.
Integrated Computer-Aided Engineering, 2009

Boundary Labeling in Text Annotation.
Proceedings of the 13th International Conference on Information Visualisation, 2009

2008
Location-aware routing protocol with dynamic adaptation of request zone for mobile ad hoc networks.
Wireless Networks, 2008

Many-to-One Boundary Labeling.
J. Graph Algorithms Appl., 2008

Decidability and Complexity Analysis of Forbidden State Problems for Discrete Event Systems.
Int. J. Found. Comput. Sci., 2008

Concurrency, Synchronization, and Conflicts in Petri Nets.
Proceedings of the Implementation and Applications of Automata, 2008

A template alignment algorithm for question classification.
Proceedings of the IEEE International Conference on Intelligence and Security Informatics, 2008

Compute the Term Contributed Frequency.
Proceedings of the Eighth International Conference on Intelligent Systems Design and Applications, 2008

An alignment-based surface pattern for a question answering system.
Proceedings of the IEEE International Conference on Information Reuse and Integration, 2008

2007
On Balloon Drawings of Rooted Trees.
J. Graph Algorithms Appl., 2007

Preface.
Int. J. Found. Comput. Sci., 2007

Korean-Chinese Cross-Language Information Retrieval Based on Extension of Dictionaries and Transliteration.
Proceedings of the 19th Conference on Computational Linguistics and Speech Processing, 2007

Balloon Views of Source Code and Their Multiscalable Font Modes.
Proceedings of the 11th International Conference on Information Visualisation, 2007

Width-Optimal Visibility Representations of Plane Graphs.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Many-to-one boundary labeling.
Proceedings of the APVIS 2007, 2007

Computing Minimal Elements of Upward-Closed Sets for Petri Nets.
Proceedings of the Petri Nets and Other Models of Concurrency, 2007

2006
Introduction to Petri Net Theory.
Proceedings of the Recent Advances in Formal Languages and Applications, 2006

Deterministic catalytic systems are not universal.
Theor. Comput. Sci., 2006

Preface.
Int. J. Found. Comput. Sci., 2006

Decidability Analysis of Self-Stabilization for Infinite-State Systems.
Fundam. Inform., 2006

On the Computational Power of 1-Deterministic and Sequential P Systems.
Fundam. Inform., 2006

Mental map preserving graph drawing using simulated annealing.
Proceedings of the Asia-Pacific Symposium on Information Visualisation, 2006

2005
Quality-of-service provisioning system for multimedia transmission in IEEE 802.11 wireless LANs.
IEEE Journal on Selected Areas in Communications, 2005

On various notions of parallelism in P Systems.
Int. J. Found. Comput. Sci., 2005

Petri Nets with Simple Circuits.
IEICE Transactions, 2005

On Deterministic Catalytic Systems.
Proceedings of the Implementation and Application of Automata, 2005

On Symport/Antiport P Systems and Semilinear Sets.
Proceedings of the Membrane Computing, 6th International Workshop, 2005

A New Force-Directed Graph Drawing Method Based on Edge-Edge Repulsion.
Proceedings of the 9th International Conference on Information Visualisation, 2005

Design and Performance Evaluation of an Optimal Collision Avoidance Mechanism over Congested and Noisy Channels for IEEE 802.11 DCF Access Method.
Proceedings of the Information Networking, 2005

Signaling P Systems and Verification Problems.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

On Balloon Drawings of Rooted Trees.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

On Sequential and 1-Deterministic P Systems.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Reachability solution characterization of parametric real-time systems.
Theor. Comput. Sci., 2004

Dependability Analysis of a Class of Probabilistic Petri Nets.
Proceedings of the 10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2004), 2004

Quality-of-service provisioning system for multimedia transmission in IEEE 802.11 wireless lans.
Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, 2004

The Power of Maximal Parallelism in P Systems.
Proceedings of the Developments in Language Theory, 2004

2003
An /spl omega/-automata approach to the representation of bilevel images.
IEEE Trans. Systems, Man, and Cybernetics, Part B, 2003

Compact floor-planning via orderly spanning trees.
J. Algorithms, 2003

On the Ramsey Numbers for Bipartite Multigraphs
CoRR, 2003

Timing Parameter Characterization of Real-Time Systems.
Proceedings of the Implementation and Application of Automata, 2003

Drawing Graphs with Nonuniform Nodes Using Potential Fields.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

Petri Nets with Simple Circuits.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002
Sequential versus concurrent languages of labeled conflict-free Petri nets.
IEEE Trans. Automat. Contr., 2002

A valuation-based analysis of conflict-free Petri nets.
Systems & Control Letters, 2002

Compact Floor-Planning via Orderly Spanning Trees
CoRR, 2002

Distributed and On-Line Routing on Tori.
Algorithmica, 2002

On Nearly Symmetric Drawings of Graphs.
Proceedings of the International Conference on Information Visualisation, 2002

Some Applications of Orderly Spanning Trees in Graph Drawing.
Proceedings of the Graph Drawing, 10th International Symposium, 2002

A Dictionary-Based Compressed Pattern Matching Algorithm.
Proceedings of the 26th International Computer Software and Applications Conference (COMPSAC 2002), 2002

2001
The symmetry number problem for trees.
Inf. Process. Lett., 2001

Parametric Optimization of Open Real-Time Systems.
Proceedings of the Static Analysis, 8th International Symposium, 2001

Analysis of Self-Stabilization for Infinite-State Systems.
Proceedings of the 7th International Conference on Engineering of Complex Computer Systems (ICECCS 2001), 2001

Floor-Planning via Orderly Spanning Trees.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

2000
An omega-automata approach to the compression of bi-level images.
Electr. Notes Theor. Comput. Sci., 2000

On Maximum Symmetric Subgraphs.
Proceedings of the Graph Drawing, 8th International Symposium, 2000

1999
Orthogonal and Straight-Line Drawings of Graphs with Succinct Representations.
Proceedings of the Graph Drawing, 7th International Symposium, 1999

1998
Competitive Analysis of On-Line Disk Scheduling.
Theory Comput. Syst., 1998

Priority Conflict-Free Petri Nets.
Acta Inf., 1998

1997
On Reachability Equivalence for BPP-Nets.
Theor. Comput. Sci., 1997

Deciding a Class of Path Formulas for Conflict-Free Petri Nets.
Theory Comput. Syst., 1997

Competitive Source Routing on Tori and Meshes.
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

1996
Deciding Bisimulation and Trace Equivalences for Systems with Many Identical Processes.
Theor. Comput. Sci., 1996

On the Regularity of Petri Net Languages.
Inf. Comput., 1996

Competitive Analysis of On-Line Disk Scheduling.
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

1995
A Note on Fine Covers and Iterable Factors of VAS Languages.
Inf. Process. Lett., 1995

Deciding Bisimulation and Trace Equivalences for Systems with Many Identical Processes.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Design, implementation, and applications of a B-ISDN simulation testbed.
Proceedings of the Proceedings 28st Annual Simulation Symposium (SS '95), 1995

1994
On multiterminal single bend wirability.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1994

Some Complexity Results for Rings of Petri Nets.
Int. J. Found. Comput. Sci., 1994

1993
Complexity Analysis of Propositional Concurrent Programs Using Domino Tiling.
Mathematical Systems Theory, 1993

Normal and Sinkless Petri Nets.
J. Comput. Syst. Sci., 1993

A Unified Approach for Reasoning about Conflict-Free Petri Nets.
Proceedings of the Application and Theory of Petri Nets 1993, 1993

1992
A Unified Approach for Deciding the Existence of Certain Petri Net Paths
Inf. Comput., January, 1992

A Multiparameter Analysis of Domino Tiling with an Application to Concurrent Systems.
Theor. Comput. Sci., 1992

1991
A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets.
Theor. Comput. Sci., 1991

Global and Local Views of State Fairness.
Theor. Comput. Sci., 1991

A Polynomial Time Algorithm to Decide Pairwise Concurrency of Transitions for 1-Bounded Conflict-Free Petri Nets.
Inf. Process. Lett., 1991

Priority Systems with many Identical Processes.
Acta Inf., 1991

1990
On Optimal Parallelization of Sorting Networks.
Theor. Comput. Sci., 1990

Communicating Processes, Scheduling, and the Complexity of Nondeterminism.
Mathematical Systems Theory, 1990

1989
Normal and Sinkless Petri Nets.
Proceedings of the Fundamentals of Computation Theory, 1989

1988
On the Complexity of Deciding fair Termination of Probabilistic Concurrent Finite-State Programs.
Theor. Comput. Sci., 1988

A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1987
Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning Omega-Machines.
SIAM J. Comput., 1987

An O(n^(1.5)) Algorithm to Decide Boundedness for Conflict-Free Vector Replacement Systems.
Inf. Process. Lett., 1987

On Optimal Parallelization of Sorting Networks.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987

1986
Boundedness, Empty Channel Detection, and Synchronization for Communicating Finite Automata.
Theor. Comput. Sci., 1986

Some Complexity Bounds for Problems Concerning Finite and 2-Dimensional Vector Addition Systems with States.
Theor. Comput. Sci., 1986

A Multiparameter Analysis of the Boundedness Problem for Vector Addition Systems.
J. Comput. Syst. Sci., 1986

Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning omega-Machines.
Proceedings of the STACS 86, 1986

On The Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs.
Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1985
Boundedness, Empty Channel Detection and Synchronization for Communicating Finite State Machines.
Proceedings of the STACS 85, 1985

A multiparameter analysis of the boundedness problem for vector addition systems.
Proceedings of the Fundamentals of Computation Theory, 1985


  Loading...