Sciweavers

5580 search results - page 637 / 1116
» Randomized priority algorithms
Sort
View
ICML
2002
IEEE
16 years 5 months ago
On generalization bounds, projection profile, and margin distribution
We study generalization properties of linear learning algorithms and develop a data dependent approach that is used to derive generalization bounds that depend on the margin distr...
Ashutosh Garg, Sariel Har-Peled, Dan Roth
ICPR
2010
IEEE
15 years 12 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
ICPR
2008
IEEE
15 years 11 months ago
Graph drawing using quantum commute time
In this paper, we explore experimentally the use of the commute time of the continuous-time quantum walk for graph drawing. For the classical random walk, the commute time has bee...
David Emms, Edwin R. Hancock, Richard C. Wilson
SOCC
2008
IEEE
95views Education» more  SOCC 2008»
15 years 11 months ago
Pseudo-random clocking to enhance signal integrity
— A methodology is proposed to reduce power/ground and substrate coupling noise by randomizing the clock signal. A pseudo-random number generation algorithm is used to produce a ...
Selcuk Kose, Emre Salman, Zeljko Ignjatovic, Eby G...
DDECS
2007
IEEE
121views Hardware» more  DDECS 2007»
15 years 11 months ago
A Novel Parity Bit Scheme for SBox in AES Circuits
– This paper addresses an efficient concurrent fault detection scheme for the SBox hardware implementation of the AES algorithm. Concurrent fault detection is important not only ...
Giorgio Di Natale, Marie-Lise Flottes, Bruno Rouze...