Sciweavers

3206 search results - page 629 / 642
» Optimizing Graph Algorithms for Improved Cache Performance
Sort
View
BMCBI
2011
14 years 6 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
PROCEDIA
2011
14 years 5 months ago
GPU-accelerated Chemical Similarity Assessment for Large Scale Databases
The assessment of chemical similarity between molecules is a basic operation in chemoinformatics, a computational area concerning with the manipulation of chemical structural info...
Marco Maggioni, Marco D. Santambrogio, Jie Liang
WSDM
2012
ACM
285views Data Mining» more  WSDM 2012»
13 years 10 months ago
Probabilistic models for personalizing web search
We present a new approach for personalizing Web search results to a specific user. Ranking functions for Web search engines are typically trained by machine learning algorithms u...
David Sontag, Kevyn Collins-Thompson, Paul N. Benn...
159
Voted
KDD
2012
ACM
207views Data Mining» more  KDD 2012»
13 years 4 months ago
Robust multi-task feature learning
Multi-task learning (MTL) aims to improve the performance of multiple related tasks by exploiting the intrinsic relationships among them. Recently, multi-task feature learning alg...
Pinghua Gong, Jieping Ye, Changshui Zhang
ATAL
2009
Springer
15 years 9 months ago
Effective tag mechanisms for evolving cooperation
Certain observable features (tags), shared by a group of similar agents, can be used to signal intentions and can be effectively used to infer unobservable properties. Such infere...
Matthew Matlock, Sandip Sen