Sciweavers

961 search results - page 79 / 193
» Significance-Driven Graph Clustering
Sort
View
ICDCS
2006
IEEE
15 years 10 months ago
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
CIKM
2010
Springer
15 years 2 months ago
Discovery of numerous specific topics via term co-occurrence analysis
We describe efficient techniques for construction of large term co-occurrence graphs, and investigate an application to the discovery of numerous fine-grained (specific) topics. A...
Omid Madani, Jiye Yu
COLING
2010
14 years 11 months ago
Topic-Based Bengali Opinion Summarization
In this paper the development of an opinion summarization system that works on Bengali News corpus has been described. The system identifies the sentiment information in each docu...
Amitava Das, Sivaji Bandyopadhyay
TKDE
2011
362views more  TKDE 2011»
14 years 11 months ago
A Link Analysis Extension of Correspondence Analysis for Mining Relational Databases
—This work introduces a link-analysis procedure for discovering relationships in a relational database or a graph, generalizing both simple and multiple correspondence analysis. ...
Luh Yen, Marco Saerens, François Fouss
ICCV
2011
IEEE
14 years 4 months ago
Probabilistic Group-Level Motion Analysis and Scenario Recognition
This paper addresses the challenge of recognizing behavior of groups of individuals in unconstraint surveillance environments. As opposed to approaches that rely on agglomerative ...
Ming-Ching Chang, Nils Krahnstoever, Weina Ge