1576 search results - page 188 / 316 » Streaming Algorithms for Independent Sets |
160
click to vote
COLT
1991
Springer
15 years 8 months ago
1991
Springer
Abstract. This paper presents a polynomial-time algorithm for inferring a probabilistic generalization of the class of read-once Boolean formulas over the usual basis {AND,OR,NOT}....
151
click to vote
AUSDM
2008
Springer
15 years 6 months ago
2008
Springer
Share-frequent pattern mining discovers more useful and realistic knowledge from database compared to the traditional frequent pattern mining by considering the non-binary frequen...
134
click to vote
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
148
click to vote
BDA
2007
15 years 6 months ago
2007
The paper presents a complete framework for spatial indexing support in a distributed setting. We consider a shared-nothing environment where a set of servers provides independent...
140
click to vote
SIAMCOMP
2000
15 years 4 months ago
2000
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...