3017 search results - page 397 / 604 » On compressing social networks |
169
click to vote
CCR
2010
15 years 6 months ago
2010
On September 23, 2009, CAIDA hosted a virtual Workshop on Internet Economics [3] to bring together network technology and policy researchers, commercial Internet facilities and se...
197
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
174
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
Abstract. This paper considers the dynamic tree (DT) model, first introduced in [1]. A dynamic tree specifies a prior over structures of trees, each of which is a forest of one or ...
155
click to vote
ICCAD
2004
IEEE
16 years 3 months ago
2004
IEEE
— In this paper we investigate an effective approach to construct a linear decompression network in the multiple scan chain architecture. A minimal pin architecture, complemented...
174
Voted
JSAC
2006
15 years 6 months ago
2006
The frequent and large-scale network attacks have led to an increased need for developing techniques for analyzing network traffic. This paper presents NetViewer, a network measure...