Sciweavers

3052 search results - page 11 / 611
» Weakly Distributive Domains
Sort
View
SRDS
1993
IEEE
14 years 3 months ago
Some Remarks on Protecting Weak Keys and Poorly-Chosen Secrets from Guessing Attacks
Authentication and key distribution protocols that utilize weak secrets (such as passwords and PINs) are traditionally susceptible to guessing attacks whereby an adversary iterate...
Gene Tsudik, Els Van Herreweghen
GLOBECOM
2006
IEEE
14 years 5 months ago
Efficient Construction of Weakly-Connected Dominating Set for Clustering Wireless Ad Hoc Networks
In most of the proposed clustering algorithms for wireless ad hoc networks, the cluster-heads form a dominating set in the network topology. A variant of dominating set which is mo...
Bo Han, Weijia Jia
JMLR
2010
153views more  JMLR 2010»
13 years 5 months ago
Generalized Expectation Criteria for Semi-Supervised Learning with Weakly Labeled Data
In this paper, we present an overview of generalized expectation criteria (GE), a simple, robust, scalable method for semi-supervised training using weakly-labeled data. GE fits m...
Gideon S. Mann, Andrew McCallum
SAINT
2005
IEEE
14 years 4 months ago
SOFAnet: Middleware for Software Distribution over Internet
The paper focuses on software distribution over the Internet, points to weaknesses of the current practice and argues for removing the weaknesses by introducing a ubiquitous distr...
Ladislav Sobr, Petr Tuma
ECAI
2006
Springer
14 years 2 months ago
A Real Generalization of Discrete AdaBoost
Scaling discrete AdaBoost to handle real-valued weak hypotheses has often been done under the auspices of convex optimization, but little is generally known from the original boost...
Richard Nock, Frank Nielsen