218 search results - page 2 / 44 » Strong Bounds Consistencies and Their Application to Linear ... |
RANDOM
1997
Springer
13 years 11 months ago
1997
Springer
The current proof of the PCP Theorem (i.e., NP = PCP(log, O(1))) is very complicated. One source of difficulty is the technically involved analysis of low-degree tests. Here, we r...
KDD
2004
ACM
14 years 7 months ago
2004
ACM
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
We propose a novel linear method for scale invariant figure ground separation in images and videos. Figure ground separation is treated as a superpixel labeling problem. We optim...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
In this paper we consider the problem of classification in the presence of pairwise constraints, which consist of pairs of examples as well as a binary variable indicating whether...
OSDI
2000
ACM
13 years 8 months ago
2000
ACM
The tradeoffs between consistency, performance, and availability are well understood. Traditionally, however, designers of replicated systems have been forced to choose from eithe...