Sciweavers

2304 search results - page 294 / 461
» On the Vulnerability of Large Graphs
Sort
View
INTERNET
2007
105views more  INTERNET 2007»
15 years 6 months ago
Workflow Planning on a Grid
evel of abstraction, we can represent a workflow as a directed graph with operators (or tasks) at the vertices (see Figure 1). Each operator takes inputs from data sources or from ...
Craig W. Thompson, Wing Ning Li, Zhichun Xiao
NIPS
2004
15 years 8 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
WWW
2006
ACM
16 years 7 months ago
Topical TrustRank: using topicality to combat web spam
Web spam is behavior that attempts to deceive search engine ranking algorithms. TrustRank is a recent algorithm that can combat web spam. However, TrustRank is vulnerable in the s...
Baoning Wu, Vinay Goel, Brian D. Davison
PERCOM
2007
ACM
16 years 6 months ago
Securing distributed data storage and retrieval in sensor networks
Sensor networks have been an attractive platform for pervasive computing and communication. Due to the lack of physical protection, however, sensor networks are vulnerable to atta...
Nalin Subramanian, Chanjun Yang, Wensheng Zhang
EUROSYS
2006
ACM
16 years 3 months ago
Reducing TCB complexity for security-sensitive applications: three case studies
The large size and high complexity of securitysensitive applications and systems software is a primary cause for their poor testability and high vulnerability. One approach to all...
Lenin Singaravelu, Calton Pu, Hermann Härtig,...