![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. David Hart 6 Eamonn J. Keogh , Selina Chu , David Hart, Michael J. Pazzani : An Online Algorithm for Segmenting Time Series. ICDM 2001 : 289-296 5 Gordon L. Kindlmann , David M. Weinstein , David Hart: Strategies for Direct Volume Rendering of Diffusion Tensor Fields. IEEE Transactions on Visualization and Computer Graphics 6 (2): 124-138 (2000) 4 Joseph L. Hellerstein , David Hart, Po Yue : Automated Drill Down: An Approach to Automated Problem Isolation for Performance Management. Int. CMG Conference 1999 3 David Hart, Philip Dutré , Donald P. Greenberg : Direct Illumination with Lazy Visibility Evaluation. SIGGRAPH 1999 : 147-154 2 David Eppstein , David Hart: Shortest Paths in an Arrangement with k Line Orientations. SODA 1999 : 310-316 1 David Eppstein , David Hart: An Efficient Algorithm for Shortest Paths in Vertical and Horizontal Segments. WADS 1997 : 234-247 ![]() DiSC'02 © 2003 Association for Computing Machinery |