2430 search results - page 380 / 486 » Computing Tutte Polynomials |
156
Voted
TCOS
2010
14 years 10 months ago
2010
Abstract. In [24] Raddum and Semaev propose a technique to solve systems of polynomial equations over F2 as occurring in algebraic attacks on block ciphers. This approach is known ...
126
click to vote
TSP
2010
14 years 10 months ago
2010
We consider the problem of approximating a regular function f(t) from its samples, f(nT), taken in a uniform grid. Quasi-interpolation schemes approximate f(t) with a dilated versi...
210
Voted
DCG
2011
14 years 6 months ago
2011
We describe a variant of a method used by modern graphic artists to design what are traditionally called Celtic knots, which are part of a larger family of designs called “mirro...
161
Voted
ICCV
2011
IEEE
14 years 3 months ago
2011
IEEE
Recent work on unsupervised feature learning has shown that learning on polynomial expansions of input patches, such as on pair-wise products of pixel intensities, can improve the...
149
Voted
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
Cooperative games provide an appropriate framework for fair and stable resource allocation in multiagent systems. This paper focusses on monotone cooperative games, a class which ...