Search

Now showing items 1-10 of 12

Computing Shortest Paths among Curved Obstacles in the Plane

Type: Journal Paper

Author : Danny Z. Chen; Haitao Wang

Year: 2015

Request PDF

A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane

Type: Journal Paper

Author : Danny Z. Chen; Haitao Wang

Year: 2011

Request PDF

A note on searching line arrangements and applications

Type: Journal Paper

Author : Danny Z. Chen; Haitao Wang

Year: 2013

Request PDF

Visibility and ray shooting queries in polygonal domains

Type: Journal Paper

Author : Danny Z. Chen; Haitao Wang

Year: 2015

Request PDF

Weak visibility queries of line segments in simple polygons

Type: Journal Paper

Author : Danny Z. Chen; Haitao Wang

Year: 2015

Request PDF

Two-Point L1 Shortest Path Queries in the Plane

Type: Journal Paper

Author : Danny Z. Chen; Rajasekhar Inkulu; Haitao Wang

Year: 2014

Request PDF

Efficient algorithms for the one-dimensional k-center problem

Type: Journal Paper

Author : Danny Z. Chen; Jian Li; Haitao Wang

Year: 2015

Request PDF

Frontiers in Algorithmics: 4th International Workshop, FAW 2010, Wuhan, China, August 11-13, 2010, Proceedings (Lecture Notes in Computer Science Theoretical Computer Science and General Issues)

Type: Ebook

Author : D.T. Lee; Danny Z. Chen; Shi Ying

Publisher: Springer

Year: 2010

Request PDF

Frontiers in algorithmics : 4th international workshop, FAW 2010, Wuhan, China, August 11-13, 2010. proceedings

Type: Ebook

Author : Der-Tsai Lee; Danny Z Chen; Shi Ying (eds)

Publisher: Springer-Verlag

Year: 2010

Request PDF

moDNN: Memory optimal DNN training on GPUs

Type: Journal Paper

Author : Xiaoming Chen; Danny Z. Chen; Xiaobo Sharon Hu

Year: 2018

Request PDF

Search

Computing Shortest Paths among Curved Obstacles in the Plane

A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane

A note on searching line arrangements and applications

Visibility and ray shooting queries in polygonal domains

Weak visibility queries of line segments in simple polygons

Two-Point L1 Shortest Path Queries in the Plane

Efficient algorithms for the one-dimensional k-center problem

Frontiers in Algorithmics: 4th International Workshop, FAW 2010, Wuhan, China, August 11-13, 2010, Proceedings (Lecture Notes in Computer Science Theoretical Computer Science and General Issues)

Frontiers in algorithmics : 4th international workshop, FAW 2010, Wuhan, China, August 11-13, 2010. proceedings

moDNN: Memory optimal DNN training on GPUs

Author

Subject

Publisher

Year

Type

Language (ISO)

Content Type

Publication Title

Search

Filters

Computing Shortest Paths among Curved Obstacles in the Plane

A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane

A note on searching line arrangements and applications

Visibility and ray shooting queries in polygonal domains

Weak visibility queries of line segments in simple polygons

Two-Point L1 Shortest Path Queries in the Plane

Efficient algorithms for the one-dimensional k-center problem

Frontiers in Algorithmics: 4th International Workshop, FAW 2010, Wuhan, China, August 11-13, 2010, Proceedings (Lecture Notes in Computer Science Theoretical Computer Science and General Issues)

Frontiers in algorithmics : 4th international workshop, FAW 2010, Wuhan, China, August 11-13, 2010. proceedings

moDNN: Memory optimal DNN training on GPUs