Sciweavers

2745 search results - page 485 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
IM
2007
15 years 4 months ago
Using PageRank to Locally Partition a Graph
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...
Reid Andersen, Fan R. K. Chung, Kevin J. Lang
VISUALIZATION
1997
IEEE
15 years 8 months ago
ROAMing terrain: real-time optimally adapting meshes
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...
KAIS
2006
110views more  KAIS 2006»
15 years 4 months ago
Multi-step density-based clustering
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...
CLUSTER
2007
IEEE
15 years 10 months ago
Anomaly localization in large-scale clusters
— 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...
Ziming Zheng, Yawei Li, Zhiling Lan
ISMB
1997
15 years 5 months ago
Inferring Gene Structures in Genomic Sequences Using Pattern Recognition and Expressed Sequence Tags
Abstract.) Ying Xu, Richard J. MuraF, and Edward C. Uberbacher Computer Science and Mathematics Division and tLife Sciences Division Computational methods for gene identification ...
Ying Xu, Richard J. Mural, Edward C. Uberbacher