500 search results - page 93 / 100 » Approximation algorithms for maximum independent set of pseu... |
101
Voted
SIGMETRICS
2008
ACM
15 years 1 months ago
2008
ACM
Ternary content-addressable memories (TCAMs) are increasingly used for high-speed packet classification. TCAMs compare packet headers against all rules in a classification database...
101
click to vote
PSB
2004
15 years 3 months ago
2004
Association studies in populations relate genomic variation among individuals with medical condition. Key to these studies is the development of efficient and affordable genotypin...
132
click to vote
CVPR
1999
IEEE
16 years 3 months ago
1999
IEEE
The task of multi-camera surveillance is to reconstruct the paths taken by all moving objects that are temporarily visible from multiple non-overlapping cameras. We present a Baye...
104
click to vote
FOCS
2008
IEEE
15 years 8 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 ...
109
click to vote
COCOON
2007
Springer
15 years 7 months ago
2007
Springer
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...