Sciweavers

75 search results - page 5 / 15
» Topological Tree Clustering of Social Network Search Results
Sort
View
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
14 years 3 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl
ICWSM
2008
13 years 10 months ago
Logsonomy: A Search Engine Folksonomy
In social bookmarking systems users describe bookmarks by keywords called tags. The structure behind these social systems, called folksonomies, can be viewed as a tripartite hyper...
Robert Jäschke, Beate Krause, Andreas Hotho, ...
ICS
2010
Tsinghua U.
14 years 6 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
SEMWEB
2007
Springer
14 years 3 months ago
JeromeDL - a Semantic Digital Library
Abstract. JeromeDL is a Semantic Digital Library engine. It uses Semantic Web and Social Networking technologies to improve browsing and searching for resources. With JeromeDL’s ...
Sebastian Ryszard Kruk, Tomasz Woroniecki, Adam Gz...
ICCSA
2004
Springer
14 years 2 months ago
Searching for 2D Spatial Network Holes
Research involving different forms of networks, such as internet networks, social networks, and cellular networks, has increasingly become an important field of study. From this wo...
Femke Reitsma, Shane Engel