Sciweavers

2503 search results - page 174 / 501
» A study of 3-arc graphs
Sort
View
STACS
2010
Springer
16 years 1 months ago
Finding Induced Subgraphs via Minimal Triangulations
Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems including Minimum Fill-i...
Fedor V. Fomin, Yngve Villanger
ASUNAM
2009
IEEE
16 years 1 months ago
Social Network Model Based on Keyword Categorization
A user profile on an online social network is characterized by its profile entries (keywords). In this paper, we study the relationship between semantic similarity of user keywo...
Prantik Bhattacharyya, Ankush Garg, Shyhtsun Felix...
PAKDD
2009
ACM
133views Data Mining» more  PAKDD 2009»
16 years 1 months ago
On Link Privacy in Randomizing Social Networks
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...
Xiaowei Ying, Xintao Wu
GLOBECOM
2009
IEEE
16 years 1 months ago
Strong Barrier Coverage with Directional Sensors
Abstract—The barrier coverage model was proposed for applications in which sensors are deployed for intrusion detection. In this paper, we study a strong barrier coverage problem...
Li Zhang, Jian Tang, Weiyi Zhang
INFOCOM
2009
IEEE
16 years 1 months ago
Absence of Evidence as Evidence of Absence: A Simple Mechanism for Scalable P2P Search
Abstract—We propose a novel search mechanism for unstructured p2p networks, and show that it is both scalable, i.e., it leads to a bounded query traffic load per peer as the pee...
Stratis Ioannidis, Peter Marbach