Sciweavers

1717 search results - page 135 / 344
» On the analysis of the (1 1) memetic algorithm
Sort
View
ICDE
2002
IEEE
106views Database» more  ICDE 2002»
16 years 7 months ago
OSSM: A Segmentation Approach to Optimize Frequency Counting
Computing the frequency of a pattern is one of the key operations in data mining algorithms. We describe a simple yet powerful way of speeding up any form of frequency counting sa...
Carson Kai-Sang Leung, Raymond T. Ng, Heikki Manni...
CEC
2009
IEEE
16 years 1 months ago
Evolving modular neural-networks through exaptation
— Despite their success as optimization methods, evolutionary algorithms face many difficulties to design artifacts with complex structures. According to paleontologists, living...
Jean-Baptiste Mouret, Stéphane Doncieux
FOCS
1997
IEEE
15 years 10 months ago
Beyond the Flow Decomposition Barrier
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Andrew V. Goldberg, Satish Rao
APPROX
2008
Springer
71views Algorithms» more  APPROX 2008»
15 years 8 months ago
Tight Bounds for Hashing Block Sources
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
Kai-Min Chung, Salil P. Vadhan
NIPS
2008
15 years 7 months ago
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
Sham M. Kakade, Karthik Sridharan, Ambuj Tewari