2612 search results - page 173 / 523 » Switching Graphs and Their Complexity |
126
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
111
click to vote
ASIACRYPT
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we present two related-key attacks on the full AES. For AES-256 we show the first key recovery attack that works for all the keys and has 299.5 time and data complex...
AVSS
2006
IEEE
15 years 7 months ago
2006
IEEE
This paper presents a novel method for illuminationinvariant and contrast preserving feature extraction, aimed at improving performance of tracking under complex light condition. ...
101
click to vote
ESANN
2007
15 years 2 months ago
2007
Natural cortical neurons form functional networks through a complex set of developmental steps. A key process in early development is the transition of the spontaneous network dyna...
COMPGEOM
2010
ACM
15 years 6 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...