Sciweavers

672 search results - page 19 / 135
» Almost Optimal Dispersers
Sort
View
FOCS
1999
IEEE
14 years 2 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
ICPR
2004
IEEE
14 years 11 months ago
Optimizing Nearest Neighbour in Random Subspaces using a Multi-Objective Genetic Algorithm
In this work, the authors have evaluated almost 20 millions ensembles of classifiers generated by several methods. Trying to optimize those ensembles based on the nearest neighbou...
Guillaume Tremblay, Robert Sabourin, Patrick Maupi...
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
14 years 2 months ago
Towards an Analysis of Local Optimization Algorithms
We introduce a variant of Aldous and Vazirani's \Go with the winners" algorithm that can be used for search graphs that are not trees. We analyze the algorithm in terms ...
Tassos Dimitriou, Russell Impagliazzo
GLOBECOM
2009
IEEE
14 years 4 months ago
Semi-Blind Gradient-Newton CMA and SDD Algorithm for MIMO Space-Time Equalisation
— Semi-blind space-time equalisation is considered for dispersive multiple-input multiple-output systems that employ high-throughput quadrature amplitude modulation signalling. A...
S. Chen, Lajos Hanzo, H.-T. Cheng
ER
2005
Springer
136views Database» more  ER 2005»
14 years 3 months ago
A Semantic Approach to Query Rewriting for Integrated XML Data
Query rewriting is a fundamental task in query optimization and data integration. With the advent of the web, there has been renewed interest in data integration, where data is dis...
Xia Yang, Mong-Li Lee, Tok Wang Ling, Gillian Dobb...