Sciweavers

7228 search results - page 129 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
142
Voted
FOCS
2004
IEEE
15 years 7 months ago
Hardness of Approximating the Shortest Vector Problem in Lattices
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
Subhash Khot
148
Voted
SIGIR
2008
ACM
15 years 3 months ago
EigenRank: a ranking-oriented approach to collaborative filtering
A recommender system must be able to suggest items that are likely to be preferred by the user. In most systems, the degree of preference is represented by a rating score. Given a...
Nathan Nan Liu, Qiang Yang
116
Voted
GECCO
2005
Springer
174views Optimization» more  GECCO 2005»
15 years 9 months ago
Diversity as a selection pressure in dynamic environments
Evolutionary algorithms (EAs) are widely used to deal with optimization problems in dynamic environments (DE) [3]. When using EAs to solve DE problems, we are usually interested i...
Lam Thu Bui, Jürgen Branke, Hussein A. Abbass
125
Voted
PIMRC
2010
IEEE
15 years 1 months ago
Asymptotic analysis of distributed multi-cell beamforming
We consider the problem of multi-cell downlink beamforming with N cells and K terminals per cell. Cooperation among base stations (BSs) has been found to increase the system throug...
Subhash Lakshminaryana, Jakob Hoydis, Mérou...
147
Voted
SIGIR
2003
ACM
15 years 8 months ago
Table extraction using conditional random fields
The ability to find tables and extract information from them is a necessary component of data mining, question answering, and other information retrieval tasks. Documents often c...
David Pinto, Andrew McCallum, Xing Wei, W. Bruce C...