430 search results - page 44 / 86 » A New Linearizing Restriction in the Pattern Matching Proble... |
JCT
2007
13 years 7 months ago
2007
A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [2] proved that these graphs have a linear number of edges. We give a sim...
SIAMCOMP
2011
13 years 2 months ago
2011
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
Face recognition algorithms need to deal with variable
lighting conditions. Near infrared (NIR) image based face
recognition technology has been proposed to effectively
overcome...
ICTAC
2009
Springer
13 years 5 months ago
2009
Springer
Online trading invariably involves dealings between strangers, so it is important for one party to be able to judge objectively the trustworthiness of the other. In such a setting,...
ESANN
2007
13 years 9 months ago
2007
In many applications, one is interested to detect certain patterns in random process signals. We consider a class of random process signals which contain sub similarities at rando...