Search

نمایش تعداد 1-10 از 12

Computing Shortest Paths among Curved Obstacles in the Plane

نوع: Journal Paper

نویسنده : Danny Z. Chen; Haitao Wang

سال: 2015

Request PDF

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

نوع: Journal Paper

نویسنده : Danny Z. Chen; Haitao Wang

سال: 2011

Request PDF

A note on searching line arrangements and applications

نوع: Journal Paper

نویسنده : Danny Z. Chen; Haitao Wang

سال: 2013

Request PDF

Visibility and ray shooting queries in polygonal domains

نوع: Journal Paper

نویسنده : Danny Z. Chen; Haitao Wang

سال: 2015

Request PDF

Weak visibility queries of line segments in simple polygons

نوع: Journal Paper

نویسنده : Danny Z. Chen; Haitao Wang

سال: 2015

Request PDF

Two-Point L1 Shortest Path Queries in the Plane

نوع: Journal Paper

نویسنده : Danny Z. Chen; Rajasekhar Inkulu; Haitao Wang

سال: 2014

Request PDF

Efficient algorithms for the one-dimensional k-center problem

نوع: Journal Paper

نویسنده : Danny Z. Chen; Jian Li; Haitao Wang

سال: 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)

نوع: Ebook

نویسنده : D.T. Lee; Danny Z. Chen; Shi Ying

ناشر: Springer

سال: 2010

Request PDF

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

نوع: Ebook

نویسنده : Der-Tsai Lee; Danny Z Chen; Shi Ying (eds)

ناشر: Springer-Verlag

سال: 2010

Request PDF

moDNN: Memory optimal DNN training on GPUs

نوع: Journal Paper

نویسنده : Xiaoming Chen; Danny Z. Chen; Xiaobo Sharon Hu

سال: 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

نویسنده

موضوع

ناشر

سال

نوع

زبان

نوع محتوا

عنوان ناشر

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