Sciweavers

88 search results - page 4 / 18
» Performance Analysis of a Family of WHT Algorithms
Sort
View
JMLR
2006
99views more  JMLR 2006»
13 years 7 months ago
Worst-Case Analysis of Selective Sampling for Linear Classification
A selective sampling algorithm is a learning algorithm for classification that, based on the past observed data, decides whether to ask the label of each new instance to be classi...
Nicolò Cesa-Bianchi, Claudio Gentile, Luca ...
ICPR
2010
IEEE
14 years 2 months ago
Statistical Shape Modeling using Morphological Representations
The aim of this paper is to propose tools for statistical analysis of shape families using morphological operators. Given a series of shape families (or shape categories), the appr...
S. Velasco-Forero and J. Angulo
MOC
2002
131views more  MOC 2002»
13 years 7 months ago
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
Douglas R. Stinson
EOR
2007
102views more  EOR 2007»
13 years 7 months ago
Sub-stochastic matrix analysis for bounds computation - Theoretical results
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
Serge Haddad, Patrice Moreaux
SPAA
2000
ACM
13 years 11 months ago
An experimental study of a simple, distributed edge coloring algorithm
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
Madhav V. Marathe, Alessandro Panconesi, Larry D. ...