83 search results - page 5 / 17 » Linear probing with constant independence |
STOC
2002
ACM
14 years 10 months ago
2002
ACM
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experie...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
We show that for k ≥ 3 even the Ω(n) level of the Lasserre hierarchy cannot disprove a random k-CSP instance over any predicate type implied by k-XOR constraints, for example ...
SIAMCO
2000
13 years 9 months ago
2000
We face the problem of determining a tracking domain of attraction, say the set of initial states starting from which it is possible to track reference signals in given class, for...
PAMI
2008
13 years 9 months ago
2008
Face recognition algorithms perform very unreliably when the pose of the probe face is different from the gallery face: typical feature vectors vary more with pose than with identi...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Motivated by random linear network coding, we study the communication through channels, called linear operator channels (LOCs), that perform linear operation over finite fields. Fo...