619 search results - page 10 / 124 » Random Bichromatic Matchings |
APPROX
2004
Springer
14 years 29 days ago
2004
Springer
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
We present a new approach to robust pose-variant face
recognition, which exhibits excellent generalization ability
even across completely different datasets due to its weak
depe...
DSD
2005
IEEE
13 years 9 months ago
2005
IEEE
Several methods improving the fault coverage in mixed-mode BIST are presented in this paper. The test is divided into two phases: the pseudo-random and deterministic. Maximum of f...
SIGECOM
2009
ACM
14 years 2 months ago
2009
ACM
We consider the problem of a search engine trying to assign a sequence of search keywords to a set of competing bidders, each with a daily spending limit. The goal is to maximize ...
DSD
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper discusses possibilities for a choice of a pseudorandom pattern generator that is to be used in combination with the column-matching based built-in self-test design meth...