Sciweavers

230 search results - page 38 / 46
» Minimum Spanning Tree Problem with Label Selection
Sort
View
INFORMATICALT
2011
170views more  INFORMATICALT 2011»
13 years 3 months ago
Community Detection Through Optimal Density Contrast of Adjacency Matrix
Detecting communities in real world networks is an important problem for data analysis in science and engineering. By clustering nodes intelligently, a recursive algorithm is desig...
Tianzhu Liang, Kwok Yip Szeto
WWW
2009
ACM
14 years 9 months ago
Quicklink selection for navigational query results
Quicklinks for a website are navigational shortcuts displayed below the website homepage on a search results page, and that let the users directly jump to selected points inside t...
Deepayan Chakrabarti, Ravi Kumar, Kunal Punera
MOBIHOC
2002
ACM
14 years 8 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
ICDE
2010
IEEE
260views Database» more  ICDE 2010»
14 years 8 months ago
Anonymizing Weighted Social Network Graphs
The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Although such analysis can facilitate better understan...
Sudipto Das, Ömer Egecioglu, Amr El Abbadi
PDPTA
2007
13 years 10 months ago
Two Graph Algorithms On an Associative Computing Model
- The MASC (for Multiple Associative Computing) model is a SIMD model enhanced with associative properties and multiple synchronous instruction streams (IS). A number of algorithms...
Mingxian Jin, Johnnie W. Baker