Sciweavers

2304 search results - page 63 / 461
» On the Vulnerability of Large Graphs
Sort
View
CIB
2005
125views more  CIB 2005»
14 years 11 months ago
An On-Line Web Visualization System with Filtering and Clustering Graph
A Web graph refers to the graph that is used to represent relationships between Web pages in cyberspace, where a node represents a URL and an edge indicates a link between two URLs...
Wei Lai, Xiaodi Huang, Ronald Wibowo, Jiro Tanaka
IPSN
2003
Springer
15 years 5 months ago
A Robust Data Delivery Protocol for Large Scale Sensor Networks
Although data forwarding algorithms and protocols have been among the first set of issues explored in sensor networking, how to reliably deliver sensing data through a vast field...
Fan Ye, Gary Zhong, Songwu Lu, Lixia Zhang
IPPS
2010
IEEE
14 years 9 months ago
Large scale complex network analysis using the hybrid combination of a MapReduce cluster and a highly multithreaded system
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...
Seunghwa Kang, David A. Bader
ICS
2010
Tsinghua U.
15 years 9 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
15 years 5 months ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert