Sciweavers

9949 search results - page 416 / 1990
» On the Network Complexity of Selection
Sort
View
227
Voted
IPPS
2005
IEEE
16 years 1 months ago
On Constructing k-Connected k-Dominating Set in Wireless Networks
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
Fei Dai, Jie Wu
ICDCS
2012
IEEE
13 years 10 months ago
DARD: Distributed Adaptive Routing for Datacenter Networks
Datacenter networks typically have many paths connecting each host pair to achieve high bisection bandwidth for arbitrary communication patterns. Fully utilizing the bisection ban...
Xin Wu, Xiaowei Yang
221
Voted
NPL
2002
151views more  NPL 2002»
15 years 7 months ago
Additive Composition of Supervised Self Organizing Maps
The learning of complex relationships can be decomposed into several neural networks. The modular organization is determined by prior knowledge of the problem that permits to split...
Jean-Luc Buessler, Jean-Philippe Urban, Julien Gre...
GIS
2008
ACM
16 years 8 months ago
Pedestrian flow prediction in extensive road networks using biased observational data
In this paper, we discuss an application of spatial data mining to predict pedestrian flow in extensive road networks using a large biased sample. Existing out-of-the-box techniqu...
Michael May, Simon Scheider, Roberto Rösler, ...
ICCCN
2008
IEEE
16 years 2 months ago
Impairment-Aware Manycast Algorithms over Optical Burst-Switched Networks
— We discuss the effect of physical impairments on manycasting service over optical burst-switched (OBS) networks. Signal quality degradation in manycast networks is an important...
Balagangadhar G. Bathula, Rajesh R. C. Bikram, Vin...