Sciweavers

10608 search results - page 406 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
WWW
2008
ACM
16 years 5 months ago
Offline matching approximation algorithms in exchange markets
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
Zeinab Abbassi, Laks V. S. Lakshmanan
VTC
2008
IEEE
162views Communications» more  VTC 2008»
15 years 10 months ago
A Novel Blind Channel Estimation Algorithm for a MIMO System
—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...
Xia Liu, Marek E. Bialkowski, Shiyang Lu, Hon Tat ...
COCOON
2005
Springer
15 years 10 months ago
A Quadratic Lower Bound for Rocchio's Similarity-Based Relevance Feedback Algorithm
Rocchio’s similarity-based relevance feedback algorithm, one of the most important query reformation methods in information retrieval, is essentially an adaptive supervised lear...
Zhixiang Chen, Bin Fu
GECCO
2005
Springer
108views Optimization» more  GECCO 2005»
15 years 10 months ago
Some theoretical results about the computation time of evolutionary algorithms
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...
Lixin X. Ding, Jinghu Yu
ICCSA
2004
Springer
15 years 9 months ago
Speculative Parallelization of a Randomized Incremental Convex Hull Algorithm
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...
Marcelo H. Cintra, Diego R. Llanos Ferraris, Bel&e...