Normal view MARC view ISBD view

Efficient parallel algorithms to compute A sub-complex of the weighted delaunay triangulation for molecular data

By:

Contributor(s):

Material type: Text

TextPublication details: Bangalore : Indian Institute of Science, 2016.Description: vii, 29 p. : col. illSubject(s):

DDC classification:

Dissertation note: MSc(Eng);2016;Computational and Data Sciences.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Status	Date due	Barcode
Thesis	JRD Tata Memorial Library	516.0028551 P16 (Browse shelf(Opens below))	Not for loan		T08941

Previous	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	Next
Previous	516 SHU Geometry	516 TAY Introduction to the ancient and modern geometry of conics : being a geometrical treatise on the conic sections with a collection of problems and historical notes and prolegomena	516.0028551 P14 Delaunay graphs for various geometric objects	516.0028551 P16 Efficient parallel algorithms to compute A sub-complex of the weighted delaunay triangulation for molecular data	516.0076 KUT Problems in Geometry	516.0247 MOR Geometrical drawing for art students /	516.028 KOM Maximum independent set of rectangles : an empirical study	Next

Includes bibliography.

MSc(Eng);2016;Computational and Data Sciences.

There are no comments on this title.

to post a comment.