1576 search results - page 162 / 316 » Streaming Algorithms for Independent Sets |
132
click to vote
ASPDAC
2001
ACM
15 years 8 months ago
2001
ACM
This paper describes a novel approach to high-level synthesis of complex pipelined circuits, including pipelined circuits with feedback. This approach combines a high-level, modula...
122
click to vote
EUSAI
2003
Springer
15 years 9 months ago
2003
Springer
The paper describes initial results in an ongoing project aimed at providing and analyzing standardized, representative data sets for typical context recognition tasks. Such data ...
141
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
152
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
148
click to vote
PODS
2012
ACM
13 years 6 months ago
2012
ACM
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...