1477 search results - page 203 / 296 » Complexity of (iterated) dominance |
FSE
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. The slide attack is applicable to ciphers that can be represented as an iterative application of the same keyed permutation. The slide attack leverages simple attacks on ...
VTC
2006
IEEE
14 years 5 months ago
2006
IEEE
The interest in near-ML detection algorithms for Multiple-Input/lMultiple-Output (MIMO) systems have always been high due to their drastic performance gain over suboptimal algorith...
ACMSE
2006
ACM
14 years 5 months ago
2006
ACM
Applications involving interactive modeling of deformable objects require highly iterative, floating-point intensive numerical simulations. As the complexity of these models incr...
VLDB
2001
ACM
14 years 3 months ago
2001
ACM
Cleaning data of errors in structure and content is important for data warehousing and integration. Current solutions for data cleaning involve many iterations of data “auditing...
KDD
1998
ACM
14 years 3 months ago
1998
ACM
Many data mining tasks (e.g., Association Rules, Sequential Patterns) use complex pointer-based data structures (e.g., hash trees) that typically suffer from sub-optimal data loca...