9842 search results - page 404 / 1969 » The Complexity of the Matching-Cut Problem |
159
click to vote
ESSLLI
2009
Springer
15 years 2 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
153
Voted
SCP
2010
14 years 11 months ago
2010
Analyzing the evolution of large and long-lived software systems is a complex problem that requires extensive tool support due to the amount and complexity of the data that needs ...
122
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
In this paper we present a novel approach to describe sound mixtures which is based on a geometric viewpoint. In this approach we extend the idea of a nearest-neighbor representat...
150
Voted
INFOCOM
2012
IEEE
13 years 7 months ago
2012
IEEE
—We study error estimating codes with the goal of establishing better bounds for the theoretical and empirical overhead of such schemes. We explore the idea of using sketch data ...
148
click to vote
COMPGEOM
1998
ACM
15 years 8 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...