Sciweavers

2987 search results - page 528 / 598
» Multiobjective Query Optimization
Sort
View
BMCBI
2011
14 years 5 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
WSDM
2012
ACM
285views Data Mining» more  WSDM 2012»
13 years 9 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...
SIGMOD
2008
ACM
297views Database» more  SIGMOD 2008»
17 years 20 days ago
Automatic Virtual Machine Configuration for Database Workloads
Virtual machine monitors are becoming popular tools for the deployment of database management systems and other enterprise software applications. In this paper, we consider a commo...
Ahmed A. Soror, Ashraf Aboulnaga, Kenneth Salem, P...
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
16 years 2 months ago
Network-Aware Operator Placement for Stream-Processing Systems
To use their pool of resources efficiently, distributed stream-processing systems push query operators to nodes within the network. Currently, these operators, ranging from simple...
Peter R. Pietzuch, Jonathan Ledlie, Jeffrey Shneid...
ICML
2009
IEEE
16 years 2 months ago
Robust bounds for classification via selective sampling
We introduce a new algorithm for binary classification in the selective sampling protocol. Our algorithm uses Regularized Least Squares (RLS) as base classifier, and for this reas...
Nicolò Cesa-Bianchi, Claudio Gentile, Franc...