Sciweavers

1041 search results - page 89 / 209
» Randomizing Reductions of Search Problems
Sort
View
KDD
2009
ACM
305views Data Mining» more  KDD 2009»
14 years 8 months ago
Grocery shopping recommendations based on basket-sensitive random walk
We describe a recommender system in the domain of grocery shopping. While recommender systems have been widely studied, this is mostly in relation to leisure products (e.g. movies...
Ming Li, M. Benjamin Dias, Ian H. Jarman, Wael El-...
GLOBECOM
2007
IEEE
14 years 2 months ago
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
Luay Azzam, Ender Ayanoglu
ICMCS
2007
IEEE
127views Multimedia» more  ICMCS 2007»
14 years 2 months ago
Reducing Motion Estimation Complexity in MPEG-2 TO H.264 Transcoding
The two key problems in video transcoding are complexity reduction and quality management. The complexity of H.264 encoding makes complexity reduction even more important. A good ...
Gerardo Fernández-Escribano, Hari Kalva, Pe...
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
14 years 2 months ago
A study of mutational robustness as the product of evolutionary computation
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
Justin Schonfeld
CIKM
2009
Springer
14 years 2 months ago
A social recommendation framework based on multi-scale continuous conditional random fields
This paper addresses the issue of social recommendation based on collaborative filtering (CF) algorithms. Social recommendation emphasizes utilizing various attributes informatio...
Xin Xin, Irwin King, Hongbo Deng, Michael R. Lyu