9842 search results - page 1670 / 1969 » The Complexity of the Matching-Cut Problem |
149
Voted
STOC
2006
ACM
16 years 5 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
219
Voted
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
140
Voted
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
— One of the central problems for data quality is inconsistency detection. Given a database D and a set Σ of dependencies as data quality rules, we want to identify tuples in D ...
132
click to vote
CVPR
2010
IEEE
16 years 10 days ago
2010
IEEE
We introduce a parametric version (pDRUR) of the recently proposed Dimensionality Reduction by Unsupervised Regression algorithm. pDRUR alternately minimizes reconstruction error ...
146
click to vote
PAKDD
2009
ACM
15 years 11 months ago
2009
ACM
One important problem proposed recently in the field of web mining is website classification problem. The complexity together with the necessity to have accurate and fast algorit...