8431 search results - page 351 / 1687 » Algorithmically Independent Sequences |
182
click to vote
ICCVW
1999
Springer
15 years 11 months ago
1999
Springer
A new approach to characterizing the performance of point-correspondencealgorithmsis presented. Instead of relyingon any \ground truth', it uses the self-consistency of the o...
162
click to vote
CCCG
2008
15 years 8 months ago
2008
We define a class of algorithms for constructing coresets of (geometric) data sets, and show that algorithms in this class can be dynamized efficiently in the insertiononly (data ...
172
Voted
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We propose blind equalization algorithms that perform similarly to supervised ones, independently of the QAM order. They converge approximately to the Wiener solution, which gener...
197
click to vote
ICPP
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper, we present a heuristic algorithm that improves the performance of static task scheduling. Our algorithm is based on the list-scheduling mechanism. For the listing p...
173
click to vote
TSP
2008
15 years 6 months ago
2008
We propose a sequential Monte Carlo (SMC)-based motif discovery algorithm that can efficiently detect motifs in datasets containing a large number of sequences. The statistical di...