5100 search results - page 593 / 1020 » The Linear Complexity of a Graph |
172
click to vote
JCPHY
2011
14 years 9 months ago
2011
This paper is concerned with the fast solution of high frequency electromagnetic scattering problems using the boundary integral formulation. We extend the O(N log N) directional ...
176
click to vote
IACR
2011
14 years 6 months ago
2011
Generic decoding of linear codes is the best known attack against most code-based cryptosystems. Understanding and measuring the complexity of the best decoding technique is thus n...
198
click to vote
FCCM
2006
IEEE
16 years 25 days ago
2006
IEEE
This paper presents a hardware-optimized variant of the well-known Gaussian elimination over GF(2) and its highly efficient implementation. The proposed hardware architecture, we...
192
click to vote
NIPS
2007
15 years 8 months ago
2007
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...
226
click to vote
AFRIGRAPH
2004
ACM
16 years 6 days ago
2004
ACM
We describe techniques for exploring 3D scenes by combining non-linear projections with the interactive data mining of camera navigations from previous explorations. Our approach ...