Sciweavers

580 search results - page 89 / 116
» Choosing a random peer
Sort
View
INFOCOM
2008
IEEE
15 years 6 months ago
Optimization Based Rate Control for Communication Networks with Inter-Session Network Coding
—In this paper we develop a distributed rate control algorithm for multiple-unicast-sessions when network coding is allowed. Building on our recent flow-based characterization o...
Abdallah Khreishah, Chih-Chun Wang, Ness B. Shroff
80
Voted
NOMS
2008
IEEE
15 years 6 months ago
A novel approach to bottleneck analysis in networks
—In this paper∗ , we devise a novel method for bottleneck analysis of UDP networks based on the concept of network utility maximization. To determine the losses on the links in...
Nikhil Shetty, Assane Gueye, Jean C. Walrand
SISAP
2008
IEEE
115views Data Mining» more  SISAP 2008»
15 years 6 months ago
A Dynamic Pivot Selection Technique for Similarity Search
All pivot-based algorithms for similarity search use a set of reference points called pivots. The pivot-based search algorithm precomputes some distances to these reference points...
Benjamin Bustos, Oscar Pedreira, Nieves R. Brisabo...
ACISICIS
2007
IEEE
15 years 6 months ago
Minimum Message Length Clustering of Spatially-Correlated Data with Varying Inter-Class Penalties
We present here some applications of the Minimum Message Length (MML) principle to spatially correlated data. Discrete valued Markov Random Fields are used to model spatial correl...
Gerhard Visser, David L. Dowe
CNSR
2007
IEEE
104views Communications» more  CNSR 2007»
15 years 6 months ago
Performance Analysis of Web Service Replica Selection in an Extranet
Providing web service replicas improves the overall system performance and redundancy for hardware failures. In Business-to-Business, this may be particularly interesting for orga...
Partheeban Chandrasekaran, Shikharesh Majumdar, Ch...