Sciweavers

2304 search results - page 321 / 461
» On the Vulnerability of Large Graphs
Sort
View
STOC
1998
ACM
125views Algorithms» more  STOC 1998»
15 years 2 months ago
Spot-Checkers
On Labor Day weekend, the highway patrol sets up spot-checks at random points on the freeways with the intention of deterring a large fraction of motorists from driving incorrectl...
Funda Ergün, Sampath Kannan, Ravi Kumar, Roni...
ICALP
1990
Springer
15 years 2 months ago
Analytic Variations on the Common Subexpression Problem
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
Philippe Flajolet, Paolo Sipala, Jean-Marc Steyaer...
ICC
2007
IEEE
162views Communications» more  ICC 2007»
15 years 1 months ago
LSP and Back Up Path Setup in MPLS Networks Based on Path Criticality Index
This paper reports on a promising approach for solving problems found when Multi Protocol Label Switching (MPLS), soon to be a dominant protocol, is used in core network systems. D...
Ali Tizghadam, Alberto Leon-Garcia
ICDM
2007
IEEE
151views Data Mining» more  ICDM 2007»
15 years 1 months ago
Combining Collective Classification and Link Prediction
The problems of object classification (labeling the nodes of a graph) and link prediction (predicting the links in a graph) have been largely studied independently. Commonly, obje...
Mustafa Bilgic, Galileo Namata, Lise Getoor
CIKM
2006
Springer
15 years 1 months ago
The visual funding navigator: analysis of the NSF funding information
This paper presents an interactive visualization toolkit for navigating and analyzing the National Science Foundation (NSF) funding information. Our design builds upon an improved...
Shixia Liu, Nan Cao, Hao Lv, Hui Su