1688 search results - page 235 / 338 » The Complexity of Rationalizing Matchings |
KDD
1998
ACM
15 years 3 months ago
1998
ACM
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
116
click to vote
CN
2007
14 years 11 months ago
2007
Motivated by the scale and complexity of simulating large-scale networks, recent research has focused on hybrid fluid/packet simulators, where fluid models are combined with pac...
107
click to vote
ICIP
2009
IEEE
14 years 9 months ago
2009
IEEE
Leading compressed sensing (CS) methods require m = O (k log(n)) compressive samples to perfectly reconstruct a k-sparse signal x of size n using random projection matrices (e.g., ...
IACR
2011
13 years 11 months ago
2011
We revisit meet-in-the-middle attacks on block ciphers and recent developments in meet-in-the-middle preimage attacks on hash functions. Despite the presence of a secret key in the...
CVPR
2004
IEEE
16 years 1 months ago
2004
IEEE
This paper proposes a joint feature-based model indexing and geometric constraint based alignment pipeline for efficient and accurate recognition of 3D objects from a large model ...