Sciweavers

2304 search results - page 317 / 461
» On the Vulnerability of Large Graphs
Sort
View
ICDM
2007
IEEE
175views Data Mining» more  ICDM 2007»
15 years 4 months ago
gApprox: Mining Frequent Approximate Patterns from a Massive Network
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han
COCOON
2007
Springer
15 years 4 months ago
Streaming Algorithms Measured in Terms of the Computed Quantity
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
Shengyu Zhang
PDP
2006
IEEE
15 years 4 months ago
Parallel Adaptive Technique for Computing PageRank
Re-ranking the search results using PageRank is a well-known technique used in modern search engines. Running an iterative algorithm like PageRank on a large web graph consumes bo...
Arnon Rungsawang, Bundit Manaskasemsak
ICPADS
2005
IEEE
15 years 3 months ago
An Efficient Partition-Based Parallel PageRank Algorithm
PageRank becomes the most well-known re-ranking technique of the search results. By its iterative computational nature, the computation takes much computing time and resource. Res...
Bundit Manaskasemsak, Arnon Rungsawang
ICPPW
2005
IEEE
15 years 3 months ago
A Comparison of Two Methods for Building Astronomical Image Mosaics on a Grid
This paper compares two methods for running an application composed of a set of modules on a grid. The set of modules (collectively called Montage) generates large astronomical im...
Daniel S. Katz, Joseph C. Jacob, G. Bruce Berriman...