Sciweavers

241 search results - page 31 / 49
» On Generating Independent Random Strings
Sort
View
CORR
2008
Springer
118views Education» more  CORR 2008»
14 years 11 months ago
Learning Low-Density Separators
Abstract. We define a novel, basic, unsupervised learning problem learning the the lowest density homogeneous hyperplane separator of an unknown probability distribution. This task...
Shai Ben-David, Tyler Lu, Dávid Pál,...
IJNSEC
2011
116views more  IJNSEC 2011»
14 years 6 months ago
An Authentication Protocol Based on Kerberos 5
We introduce some modifications to the widely deployed Kerberos authentication protocol. The principle’s secretkey will be independent of the user password to overcome the weak...
Eman El-Emam, Magdy Koutb, Hamdy Kelash, Osama S. ...
92
Voted
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
15 years 1 months ago
IMproved results for route planning in stochastic transportation
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
Justin A. Boyan, Michael Mitzenmacher
EATCS
1998
250views more  EATCS 1998»
14 years 11 months ago
Human Visual Perception and Kolmogorov Complexity: Revisited
Experiments have shown [2] that we can only memorize images up to a certain complexity level, after which, instead of memorizing the image itself, we, sort of, memorize a probabil...
Vladik Kreinovich, Luc Longpré
INFOCOM
2007
IEEE
15 years 6 months ago
Paradox of Shortest Path Routing for Large Multi-Hop Wireless Networks
— In this paper, we analyze the impact of straight line routing in large homogeneous multi-hop wireless networks. We estimate the nodal load, which is defined as the number of p...
Sungoh Kwon, Ness B. Shroff