1576 search results - page 85 / 316 » Streaming Algorithms for Independent Sets |
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
We propose a new algorithm for independent component and independent subspace analysis problems. This algorithm uses a contrast based on the Schweizer-Wolff measure of pairwise de...
178
click to vote
ICDT
2009
ACM
15 years 10 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
EOR
2010
14 years 10 months ago
2010
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract— This paper considers compression in packet networks. Since data packets may be dropped or arrive reordered, streaming compression algorithms result in a considerable de...
FSTTCS
2004
Springer
15 years 3 months ago
2004
Springer
The join of two sets of facts, E1 and E2, is defined as the set of all facts that are implied independently by both E1 and E2. Congruence closure is a widely used representation f...