Travelled to:1 × Australia
3 × USA
Collaborated with:M.D.F.Wong H.Kong Q.Ma J.Li B.Yang J.Yu C.Li L.Ulanova H.Chen G.Jiang E.J.Keogh K.Zhang
Talks about:algorithm (2) rout (2) represent (1) placement (1) manhattan (1) rectangl (1) disjoint (1) triangl (1) planner (1) network (1)
Person: Tan Yan
DBLP: Yan:Tan
Contributed to:
2015
201020092004Wrote 5 papers:
- KDD-2015-UlanovaYCJKZ #performance #physics #profiling
- Efficient Long-Term Degradation Profiling in Time Series for Complex Physical Systems (LU, TY, HC, GJ, EJK, KZ), pp. 2167–2176.
- DAC-2010-KongMYW #algorithm
- An optimal algorithm for finding disjoint rectangles and its application to PCB routing (HK, QM, TY, MDFW), pp. 212–217.
- DAC-2009-KongYW #automation
- Automatic bus planner for dense PCBs (HK, TY, MDFW), pp. 326–331.
- DAC-2009-YanW #network
- A correct network flow model for escape routing (TY, MDFW), pp. 332–335.
- DAC-2004-LiYYYL #adaptation #algorithm #design #representation #using
- A packing algorithm for non-manhattan hexagon/triangle placement design by using an adaptive o-tree representation (JL, TY, BY, JY, CL), pp. 646–651.