Sciweavers

1439 search results - page 89 / 288
» Fast approximation of centrality
Sort
View
SPAA
1997
ACM
15 years 2 months ago
HARP: A Fast Spectral Partitioner
- Partitioning unstructured graphs is central to the parallel solution of computational science and engineering problems. Spectral partitioners, such recursive spectral bisection (...
Horst D. Simon, Andrew Sohn, Rupak Biswas
DATAMINE
2006
164views more  DATAMINE 2006»
14 years 10 months ago
Fast Distributed Outlier Detection in Mixed-Attribute Data Sets
Efficiently detecting outliers or anomalies is an important problem in many areas of science, medicine and information technology. Applications range from data cleaning to clinica...
Matthew Eric Otey, Amol Ghoting, Srinivasan Partha...
GBRPR
2007
Springer
15 years 1 months ago
Constellations and the Unsupervised Learning of Graphs
Abstract. In this paper, we propose a novel method for the unsupervised clustering of graphs in the context of the constellation approach to object recognition. Such method is an E...
Boyan Bonev, Francisco Escolano, Miguel Angel Loza...
IPPS
2005
IEEE
15 years 3 months ago
Distributed Scheduling of Parallel I/O in the Presence of Data Replication
This paper studies distributed scheduling of parallel I/O data transfers on systems that provide data replication. In our previous work, we proposed a centralized algorithm for so...
Jan-Jan Wu, Pangfeng Liu
ISVC
2009
Springer
15 years 4 months ago
Fast Occlusion Sweeping
While realistic illumination significantly improves the visual quality and perception of rendered images, it is often very expensive to compute. In this paper, we propose a new al...
Mayank Singh, Cem Yuksel, Donald H. House