1576 search results - page 182 / 316 » Streaming Algorithms for Independent Sets |
125
click to vote
CORR
2000
Springer
15 years 4 months ago
2000
Springer
We consider the adaptation of random early detection (RED) as an active queue management algorithm for TCP traffic in Internet gateways where different maximum transfer units (MTU...
180
click to vote
EDBT
2004
ACM
16 years 4 months ago
2004
ACM
In recent years, privacy preserving data mining has become an important problem because of the large amount of personal data which is tracked by many business applications. In many...
127
click to vote
WG
2007
Springer
15 years 10 months ago
2007
Springer
Cographs are those graphs without induced path on four vertices. A graph G is a probe cograph if its vertex set can be partitioned into two sets, N (non-probes) and P (probes) wher...
171
click to vote
ICDE
1993
IEEE
15 years 8 months ago
1993
IEEE
A topic that is currently inspiring a lot of research is parallel (distributed) computation of transitive closure queries. In [lo] the disconnection set approach has been introduc...
330
click to vote
PAMI
2010
15 years 2 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...