Sciweavers

2168 search results - page 169 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
104
Voted
GECCO
2008
Springer
118views Optimization» more  GECCO 2008»
15 years 4 months ago
Theoretical analysis of diversity mechanisms for global exploration
Maintaining diversity is important for the performance of evolutionary algorithms. Diversity mechanisms can enhance global exploration of the search space and enable crossover to ...
Tobias Friedrich, Pietro Simone Oliveto, Dirk Sudh...
97
Voted
COMPGEOM
2006
ACM
15 years 9 months ago
How slow is the k-means method?
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
David Arthur, Sergei Vassilvitskii
109
Voted
DCC
2005
IEEE
16 years 3 months ago
A Point-Set Compression Heuristic for Fiber-Based Certificates of Authenticity
A certificate of authenticity (COA) is an inexpensive physical object that has a random unique structure with high cost of near-exact reproduction. An additional requirement is th...
Darko Kirovski
125
Voted
ICASSP
2010
IEEE
15 years 3 months ago
Automatic detection of well sampled images via a new ringing measure
According to Shannon Sampling Theory, Fourier interpolation is the optimal way to reach subpixel accuracy from a properly-sampled digital image. However, for most images this inte...
Gwendoline Blanchet, Lionel Moisan, Bernard Roug&e...
148
Voted
INFOCOM
2012
IEEE
13 years 6 months ago
Dynamic index coding for wireless broadcast networks
Abstract— We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certai...
Michael J. Neely, Arash Saber Tehrani, Zhen Zhang