4432 search results - page 649 / 887 » Solving Demodulation as an Optimization Problem |
101
click to vote
STOC
2009
ACM
16 years 1 months ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
101
Voted
KDD
2006
ACM
16 years 1 months ago
2006
ACM
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
84
Voted
STOC
2007
ACM
16 years 1 months ago
2007
ACM
We study the stability of the Max-Weight protocol for combined routing and scheduling in communication networks. Previous work has shown that this protocol is stable for adversari...
98
Voted
SDM
2009
SIAM
15 years 10 months ago
2009
SIAM
One of the most well-studied problems in data mining is computing association rules from large transactional databases. Often, the rule collections extracted from existing datamin...
95
Voted
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
Purely bottom-up, unsupervised segmentation of a single
image into two segments remains a challenging task for
computer vision. The co-segmentation problem is the process
of joi...