Sciweavers

3946 search results - page 306 / 790
» The computational complexity of choice sets
Sort
View
CGO
2005
IEEE
16 years 12 days ago
Optimizing Sorting with Genetic Algorithms
The growing complexity of modern processors has made the generation of highly efficient code increasingly difficult. Manual code generation is very time consuming, but it is oft...
Xiaoming Li, María Jesús Garzar&aacu...
BMCBI
2006
169views more  BMCBI 2006»
15 years 6 months ago
Comparative analysis of haplotype association mapping algorithms
Background: Finding the genetic causes of quantitative traits is a complex and difficult task. Classical methods for mapping quantitative trail loci (QTL) in miceuse an F2 cross b...
Phillip McClurg, Mathew T. Pletcher, Tim Wiltshire...
SIGIR
2011
ACM
14 years 9 months ago
Fast context-aware recommendations with factorization machines
The situation in which a choice is made is an important information for recommender systems. Context-aware recommenders take this information into account to make predictions. So ...
Steffen Rendle, Zeno Gantner, Christoph Freudentha...
CCGRID
2006
IEEE
16 years 26 days ago
Large Scale Distributed Simulation on the Grid
The development of many complex simulation applications requires collaborative effort from researchers with different domain knowledge and expertise, possibly at different locatio...
Georgios K. Theodoropoulos, Yi Zhang, Dan Chen, Ro...
JCP
2007
104views more  JCP 2007»
15 years 6 months ago
Cyclic Convolution Algorithm Formulations Using Polynomial Transform Theory
— This work presents a mathematical framework for the development of efficient algorithms for cyclic convolution computations. The framework is based on the Chinese Reminder Theo...
Abraham H. Diaz-Perez, Domingo Rodríguez