3415 search results - page 175 / 683 » Lower Bounds for Kernelizations |
132
click to vote
EOR
2007
15 years 4 months ago
2007
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
168
click to vote
ICCV
2003
IEEE
16 years 6 months ago
2003
IEEE
A novel approach to pattern matching is presented, which reduces time complexity by two orders of magnitude compared to traditional approaches. The suggested approach uses an effi...
164
click to vote
CRYPTO
2010
Springer
15 years 5 months ago
2010
Springer
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
139
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We obtain improved upper bounds and new lower bounds on the chromatic number as a linear function of the clique number, for the intersection graphs (and their complements) of fini...
130
click to vote
GC
2007
Springer
15 years 4 months ago
2007
Springer
We determine lower and upper bounds for the size of a hyperplane of the dual polar space DW(5, q). In some cases, we also determine all hyperplanes attaining these bounds.