745 search results - page 58 / 149 » On Generating Random Network Structures: Connected Graphs |
95
Voted
IDA
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
109
click to vote
WG
1993
Springer
15 years 4 months ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
98
Voted
SEMWEB
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Social Network Analysis (SNA) provides graph algorithms to characterize the structure of social networks, strategic positions in these networks, specific sub-networks and...
108
Voted
FGR
2008
IEEE
15 years 7 months ago
2008
IEEE
This paper presents an algorithm for measuring hair and face appearance in 2D images. Our approach starts by using learned mixture models of color and location information to sugg...
88
Voted
CORR
2007
Springer
15 years 16 days ago
2007
Springer
abstract such additional information as network annotations. We introduce a network topology modeling framework that treats annotations as an extended correlation profile of a net...