740 search results - page 123 / 148 » FAST Extended Release |
ATAL
2011
Springer
12 years 9 months ago
2011
Springer
Recent applications of game theory in security domains use algorithms to solve a Stackelberg model, in which one player (the leader) first commits to a mixed strategy and then th...
CP
2011
Springer
12 years 9 months ago
2011
Springer
Algorithm portfolios aim to increase the robustness of our ability to solve problems efficiently. While recently proposed algorithm selection methods come ever closer to identifyin...
HPCC
2011
Springer
12 years 9 months ago
2011
Springer
— Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by mess...
JMLR
2012
12 years 9 days ago
2012
In this paper, we propose to apply sparse canonical correlation analysis (sparse CCA) to an important genome-wide association study problem, eQTL mapping. Existing sparse CCA mode...
INFOCOM
2012
IEEE
12 years 9 days ago
2012
IEEE
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...