Sciweavers

4781 search results - page 629 / 957
» Online algorithms for network design
Sort
View
210
Voted
INFORMATICALT
2011
170views more  INFORMATICALT 2011»
15 years 1 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
KDD
2012
ACM
205views Data Mining» more  KDD 2012»
13 years 9 months ago
Intrusion as (anti)social communication: characterization and detection
A reasonable definition of intrusion is: entering a community to which one does not belong. This suggests that in a network, intrusion attempts may be detected by looking for com...
Qi Ding, Natallia Katenka, Paul Barford, Eric D. K...
ICC
2009
IEEE
142views Communications» more  ICC 2009»
16 years 1 months ago
Localized Sensor Self-Deployment for Guaranteed Coverage Radius Maximization
—Focused coverage is defined as the coverage of a wireless sensor network surrounding a point of interest (POI), and is measured by coverage radius, i.e., minimum distance from ...
Xu Li, Hannes Frey, Nicola Santoro, Ivan Stojmenov...
PAMI
1998
88views more  PAMI 1998»
15 years 6 months ago
Large-Scale Parallel Data Clustering
—Algorithmic enhancements are described that enable large computational reduction in mean square-error data clustering. These improvements are incorporated into a parallel data-c...
Dan Judd, Philip K. McKinley, Anil K. Jain
INFOCOM
2005
IEEE
16 years 8 days ago
Provably competitive adaptive routing
Abstract— An ad hoc wireless network is an autonomous selforganizing system of mobile nodes connected by wireless links where nodes not in direct range communicate via intermedia...
Baruch Awerbuch, David Holmer, Herbert Rubens, Rob...