Sciweavers

124 search results - page 22 / 25
» Randomly supported independence and resistance
Sort
View
SPAA
2003
ACM
14 years 18 days ago
A practical algorithm for constructing oblivious routing schemes
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
Marcin Bienkowski, Miroslaw Korzeniowski, Harald R...
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
13 years 11 months ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio
CN
2007
117views more  CN 2007»
13 years 7 months ago
Cellular universal IP for nested network mobility
In recent years, network mobility (NEMO) has been studied extensively due to its potential applications in military and public transportation. NEMO basic support protocol (NBSP), ...
Patrick P. Lam, Soung C. Liew, Jack Y. B. Lee
INTERNET
2010
119views more  INTERNET 2010»
13 years 5 months ago
A Chat Application in Lift
s the HTTP request–response cycle rather than wrapping HTTP concepts in APIs. This means you put HTML element definition and action in the same place: var name = "" SHt...
David Pollak, Steve Vinoski
CORR
2011
Springer
143views Education» more  CORR 2011»
12 years 11 months ago
Non-malleable extractors via character sums
In studying how to communicate over a public channel with an active adversary, Dodis and Wichs introduced the notion of a non-malleable extractor. A non-malleable extractor dramat...
Trevor D. Wooley, David Zuckerman