Sciweavers

5606 search results - page 508 / 1122
» Randomization Techniques for Graphs.
Sort
View
234
Voted
ISPA
2004
Springer
16 years 6 days ago
Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs
Static DHT topologies influence important features of such DHTs such as scalability, communication load balancing, routing efficiency and fault tolerance. Nevertheless, it is co...
Changtao Qu, Wolfgang Nejdl, Matthias Kriesell
207
Voted
DBSEC
2006
131views Database» more  DBSEC 2006»
15 years 8 months ago
Interactive Analysis of Attack Graphs Using Relational Queries
Abstract. Attack graph is important in defending against well-orchestrated network intrusions. However, the current analysis of attack graphs requires an algorithm to be developed ...
Lingyu Wang, Chao Yao, Anoop Singhal, Sushil Jajod...
303
Voted
IJCV
2006
299views more  IJCV 2006»
15 years 6 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea
WWW
2005
ACM
16 years 7 months ago
Incremental page rank computation on evolving graphs
Link Analysis has been a popular and widely used Web mining technique, especially in the area of Web search. Various ranking schemes based on link analysis have been proposed, of ...
Prasanna Kumar Desikan, Nishith Pathak, Jaideep Sr...
182
Voted
MICRO
2009
IEEE
132views Hardware» more  MICRO 2009»
16 years 1 months ago
Finding concurrency bugs with context-aware communication graphs
Incorrect thread synchronization often leads to concurrency bugs that manifest nondeterministically and are difficult to detect and fix. Past work on detecting concurrency bugs ...
Brandon Lucia, Luis Ceze