9842 search results - page 1366 / 1969 » The Complexity of the Matching-Cut Problem |
182
click to vote
FOCS
2006
IEEE
16 years 1 months ago
2006
IEEE
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
211
click to vote
EDBT
2008
ACM
16 years 7 months ago
2008
ACM
Modern enterprise data warehouses have complex workloads that are notoriously difficult to manage. An important problem in workload management is to run these complex workloads `o...
221
click to vote
MOBIHOC
2008
ACM
16 years 6 months ago
2008
ACM
In many emerging applications, data streams are monitored in a network environment. Due to limited communication bandwidth and other resource constraints, a critical and practical...
226
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
204
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
—Fueled by the promises of high spectral efficiency, adaptive OFDMA has attracted enormous research interests over the last decade. The significant capacity gain of adaptive OF...