A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
Terrain visualization is a difficult problem for applications requiring accurate images of large datasets at high frame rates, such as flight simulation and ground-based aircraf...
Mark A. Duchaineau, Murray Wolinsky, David E. Sige...
Abstract. Data mining in large databases of complex objects from scientific, engineering or multimedia applications is getting more and more important. In many areas, complex dista...
Stefan Brecheisen, Hans-Peter Kriegel, Martin Pfei...
— A critical problem facing by managing large-scale clusters is to identify the location of problems in a system in case of unusual events. As the scale of high performance compu...
Abstract.) Ying Xu, Richard J. MuraF, and Edward C. Uberbacher Computer Science and Mathematics Division and tLife Sciences Division Computational methods for gene identification ...