9842 search results - page 271 / 1969 » The Complexity of the Matching-Cut Problem |
108
Voted
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
197
Voted
ICDT
2009
ACM
16 years 1 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...
109
click to vote
RTAS
2009
IEEE
15 years 7 months ago
2009
IEEE
Over the last few years, Real-Time Calculus has been used extensively to model and analyze embedded systems processing continuous data/event streams. Towards this, bounds on the a...
113
click to vote
ACMICEC
2003
ACM
15 years 5 months ago
2003
ACM
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
106
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
In this paper we consider the problem of reconstructing a hidden weighted
hypergraph of constant rank using additive queries. We prove the following: Let G be
a weighted hidden h...