Sciweavers

11371 search results - page 370 / 2275
» The network inhibition problem
Sort
View
TPDS
2010
98views more  TPDS 2010»
15 years 5 months ago
Minimum Latency Gossiping in Radio Networks
—We studied the minimum latency gossiping (all-to-all broadcast) problem in multihop radio networks defined as follows: Each node in the network is preloaded with a message and t...
Scott C.-H. Huang, Peng-Jun Wan, Hongwei Du, E. K....
ICIP
2007
IEEE
16 years 1 months ago
Using a Markov Network to Recognize People in Consumer Images
Markov networks are an effective tool for the difficult but important problem of recognizing people in consumer image collections. Given a small set of labeled faces, we seek to ...
Andrew C. Gallagher, Tsuhan Chen
OL
2011
277views Neural Networks» more  OL 2011»
15 years 1 months ago
An exact algorithm for minimum CDS with shortest path constraint in wireless networks
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu ...
KDD
2008
ACM
284views Data Mining» more  KDD 2008»
16 years 7 months ago
Community evolution in dynamic multi-mode networks
A multi-mode network typically consists of multiple heterogeneous social actors among which various types of interactions could occur. Identifying communities in a multi-mode netw...
Lei Tang, Huan Liu, Jianping Zhang, Zohreh Nazeri
SPAA
2004
ACM
16 years 9 days ago
Pagoda: a dynamic overlay network for routing, data management, and multicasting
The tremendous growth of public interest in peer-to-peer systems in recent years has initiated a lot of research work on how to design efficient and robust overlay networks for t...
Ankur Bhargava, Kishore Kothapalli, Chris Riley, C...