Sciweavers

90 search results - page 2 / 18
» Stipple Placement using Distance in a Weighted Graph
Sort
View
NETWORK
2010
122views more  NETWORK 2010»
13 years 20 hour ago
Betweenness centrality and resistance distance in communication networks
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...
Ali Tizghadam, Alberto Leon-Garcia
JNSM
2008
93views more  JNSM 2008»
13 years 5 months ago
Optimal IDS Sensor Placement and Alert Prioritization Using Attack Graphs
We optimally place intrusion detection system (IDS) sensors and prioritize IDS alerts using attack graph analysis. We begin by predicting all possible ways of penetrating a networ...
Steven Noel, Sushil Jajodia
JALC
2002
97views more  JALC 2002»
13 years 4 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri
CVPR
2010
IEEE
14 years 1 months ago
Geodesic Graph Cut for Interactive Image Segmentation
Interactive segmentation is useful for selecting objects of interest in images and continues to be a topic of much study. Methods that grow regions from foreground/background seed...
Brian Price, Bryan Morse, Scott Cohen
INCDM
2007
Springer
121views Data Mining» more  INCDM 2007»
13 years 11 months ago
Collaborative Filtering Using Electrical Resistance Network Models
Abstract. In a recommender system where users rate items we predict the rating of items users have not rated. We define a rating graph containing users and items as vertices and r...
Jérôme Kunegis, Stephan Schmidt