9842 search results - page 353 / 1969 » The Complexity of the Matching-Cut Problem |
163
click to vote
IJCAI
2001
15 years 5 months ago
2001
The AC-3 algorithm is a basic and widely used arc consistency enforcing algorithm in Constraint Satisfaction Problems (CSP). Its strength lies in that it is simple, empirically ef...
133
click to vote
JMM2
2007
15 years 4 months ago
2007
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
151
click to vote
APNOMS
2009
Springer
15 years 1 months ago
2009
Springer
The inherent and increasing complexity, heterogeneity and unpredictability of computer networks make the task of managing these systems highly complex. The autonomic computing para...
127
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
127
click to vote
PODS
2010
ACM
15 years 9 months ago
2010
ACM
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...