7930 search results - page 236 / 1586 » Greedy in Approximation Algorithms |
161
click to vote
IPCO
2001
15 years 8 months ago
2001
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
149
click to vote
ICDM
2007
IEEE
16 years 25 days ago
2007
IEEE
Data mining algorithms use various Trie and bitmap-based representations to optimize the support (i.e., frequency) counting performance. In this paper, we compare the memory requi...
186
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— We consider the problem of determining the existence of known constant signals over a set of sites, given noisy measurements obtained by a team of active sensors that can switc...
157
click to vote
APGV
2007
ACM
15 years 10 months ago
2007
ACM
We present a novel perceptual method to reduce the visual redundancy of unstructured lumigraphs, an image based representation designed for interactive rendering. We combine featu...
196
click to vote
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
We consider the problem of selecting a subset of p out of n sensors for the purpose of event detection, in a wireless sensor network (WSN). Occurrence or not of the event of intere...