1576 search results - page 21 / 316 » Streaming Algorithms for Independent Sets |
FCT
2007
Springer
15 years 3 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
CINQ
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
ISPE
2003
14 years 11 months ago
2003
: Work to date on computational models of negotiation has focused almost exclusively on defining agreements consisting of one or a few independent issues. The negotiation involved ...
174
click to vote
VLDB
2004
ACM
15 years 10 months ago
2004
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
ICIP
2006
IEEE
15 years 11 months ago
2006
IEEE
This paper proposes an object-oriented approach for streaming synthetic graphic contents over a packet-erasure channel. Graphic objects such as geometric meshes and texture images...