Sciweavers

443 search results - page 19 / 89
» Analysis of Heuristics for Number Partitioning
Sort
View
ICML
2005
IEEE
14 years 8 months ago
Error bounds for correlation clustering
This paper presents a learning theoretical analysis of correlation clustering (Bansal et al., 2002). In particular, we give bounds on the error with which correlation clustering r...
Thorsten Joachims, John E. Hopcroft
PODS
2008
ACM
153views Database» more  PODS 2008»
14 years 7 months ago
Approximation algorithms for co-clustering
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
Aris Anagnostopoulos, Anirban Dasgupta, Ravi Kumar
IMA
2007
Springer
97views Cryptology» more  IMA 2007»
14 years 1 months ago
Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes
Non-linear cryptanalysis is a natural extension to Matsui’s linear cryptanalitic techniques in which linear approximations are replaced by nonlinear expressions. Non-linear appro...
Juan M. Estévez-Tapiador, John A. Clark, Ju...
GECCO
1999
Springer
148views Optimization» more  GECCO 1999»
13 years 12 months ago
An Analysis of Automatic Subroutine Discovery in Genetic Programming
This paper analyses Rosca's ARL as a general framework for automatic subroutine discovery. We review and compare a number of heuristics for code selection, and experimentally...
Antonello Dessi, Antonella Giani, Antonina Starita
ALENEX
2008
180views Algorithms» more  ALENEX 2008»
13 years 9 months ago
Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing
The National Airspace System (NAS) is designed to accommodate a large number of flights over North America. For purposes of workload limitations for air traffic controllers, the a...
Amitabh Basu, Joseph S. B. Mitchell, Girishkumar S...