Sciweavers

3016 search results - page 87 / 604
» The Online Transportation Problem
Sort
View
CCR
2004
84views more  CCR 2004»
13 years 10 months ago
On making SCTP robust to spurious retransmissions
Network anomalies such as packet reordering and delay spikes can result in spurious retransmissions and degrade performance of reliable transport protocols such as TCP and SCTP. P...
Sourabh Ladha, Stephan Baucke, Reiner Ludwig, Paul...
CN
2010
134views more  CN 2010»
13 years 8 months ago
TCP Libra: Derivation, analysis, and comparison with other RTT-fair TCPs
— The Transmission Control Protocol (TCP), the most widely used transport protocol over the Internet, has been advertised to implement fairness between flows competing for the s...
Gustavo Marfia, Claudio E. Palazzi, Giovanni Pau, ...
ICIP
2010
IEEE
13 years 8 months ago
Earth Mover Distance on superpixels
Earth Mover Distance (EMD) is a popular distance to compute distances between Probability Density Functions (PDFs). It has been successfully applied in a wide selection of problem...
Sylvain Boltz, Frank Nielsen, Stefano Soatto
COCOON
2007
Springer
14 years 2 months ago
An Improved Algorithm for Online Unit Clustering
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
Hamid Zarrabi-Zadeh, Timothy M. Chan
DGO
2007
142views Education» more  DGO 2007»
13 years 11 months ago
ARGOS: dynamic composition of web services for goods movement analysis and planning (project highlights 2007)
Poster. We highlight the latest developments in the Argos project. First, we describe our approach to automatic workflow composition. Second, we discuss the validation of the fre...
José Luis Ambite, Genevieve Giuliano, Peter...