1321 search results - page 42 / 265 » Quadratic forms on graphs |
131
click to vote
MFCS
2007
Springer
15 years 11 months ago
2007
Springer
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
163
Voted
FOCS
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract. We present a Fourier-analytic approach to list-decoding Reed-Muller codes over arbitrary finite fields. We use this to show that quadratic forms over any field are locall...
172
click to vote
BMVC
2010
15 years 11 days ago
2010
Many recent keypoint detectors associate a local scale (for multiscale detectors) or even a full affine frame (for affine-invariant detectors) to each detected keypoint. Although ...
162
Voted
IACR
2011
14 years 5 months ago
2011
In this paper we present a new practical key-recovery attack on the SFLASH signature scheme. SFLASH is a derivative of the older C∗ encryption and signature scheme that was broke...
147
click to vote
IPPS
1999
IEEE
15 years 9 months ago
1999
IEEE
In this paper we present new algorithms for spectral graph partitioning. Previously, the best partitioning methods were based on a combination of Combinatorial algorithms and appli...