1536 search results - page 154 / 308 » Approximately Dominating Representatives |
151
Voted
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
159
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
176
Voted
SIAMCOMP
2010
15 years 2 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
139
Voted
DCOSS
2011
Springer
14 years 3 months ago
2011
Springer
—Sensor networks are often redundant by design; this is often done in order to achieve reliability in information processing. In many cases, the redundancy relationships between ...
112
Voted
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
Advances in object detection have made it possible to
collect large databases of certain objects. In this paper we
exploit these datasets for within-object classification. For
e...