Sciweavers

2638 search results - page 508 / 528
» Random Geometric Complexes
Sort
View
ICNP
2002
IEEE
14 years 28 days ago
Using Adaptive Rate Estimation to Provide Enhanced and Robust Transport over Heterogeneous Networks
The rapid advancement in wireless communication technology has spurred significant interest in the design and development of enhanced TCP protocols. Among them, TCP Westwood (TCPW...
Ren Wang, Massimo Valla, M. Y. Sanadidi, Mario Ger...
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
14 years 24 days ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
EUROCRYPT
2010
Springer
14 years 24 days ago
Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
Abstract. Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles an...
Sebastian Faust, Tal Rabin, Leonid Reyzin, Eran Tr...
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
14 years 24 days ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor
ICALP
2001
Springer
14 years 14 days ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan