264 search results - page 18 / 53 » On Linear Cryptanalysis with Many Linear Approximations |
DSD
2010
IEEE
14 years 12 months ago
2010
IEEE
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...
114
click to vote
HEURISTICS
1998
14 years 11 months ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
116
click to vote
SCIA
2009
Springer
15 years 6 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
175
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract-- Large graph datasets are common in many emerging database applications, and most notably in large-scale scientific applications. To fully exploit the wealth of informati...
IJON
2006
14 years 11 months ago
2006
We present a framework for efficient extrapolation of reduced rank approximations, graph kernels, and locally linear embeddings (LLE) to unseen data. We also present a principled ...