Sciweavers

2421 search results - page 114 / 485
» Approximate Flow-Aware Networking
Sort
View
HOTOS
2007
IEEE
15 years 7 months ago
Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
Bernard Wong, Ymir Vigfusson, Emin Gün Sirer
INFOCOM
2009
IEEE
15 years 9 months ago
Capacity of Arbitrary Wireless Networks
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
Olga Goussevskaia, Roger Wattenhofer, Magnú...
NN
2000
Springer
192views Neural Networks» more  NN 2000»
15 years 2 months ago
A new algorithm for learning in piecewise-linear neural networks
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...
Emad Gad, Amir F. Atiya, Samir I. Shaheen, Ayman E...
INFOCOM
2010
IEEE
15 years 1 months ago
Cross-layer Optimization for Wireless Networks with Deterministic Channel Models
Abstract—Existing work on cross-layer optimization for wireless networks adopts simple physical-layer models, i.e., treating interference as noise. In this paper, we adopt a dete...
Ziyu Shao, Minghua Chen, Salman Avestimehr, Shuo-Y...
INFOCOM
2010
IEEE
15 years 1 months ago
Optimal Probing for Unicast Network Delay Tomography
—Network tomography has been proposed to ascertain internal network performances from end-to-end measurements. In this work, we present priority probing, an optimal probing schem...
Yu Gu, Guofei Jiang, Vishal Singh, Yueping Zhang