10988 search results - page 492 / 2198 » Algorithmic Folding Complexity |
177
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
174
click to vote
VTC
2008
IEEE
16 years 26 days ago
2008
IEEE
—In this paper, a novel blind channel estimation algorithm for a multiple input multiple output (MIMO) system is described. This algorithm is easier to implement than the previou...
147
click to vote
COCOON
2005
Springer
16 years 21 hour ago
2005
Springer
Rocchio’s similarity-based relevance feedback algorithm, one of the most important query reformation methods in information retrieval, is essentially an adaptive supervised lear...
154
click to vote
GECCO
2005
Springer
16 years 10 hour ago
2005
Springer
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
162
click to vote
ICCSA
2004
Springer
15 years 12 months ago
2004
Springer
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...