Sciweavers

640 search results - page 101 / 128
» Query Optimization Using Multiple SIP Strategies
Sort
View
153
Voted
BMCBI
2011
14 years 4 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
118
Voted
BTW
2009
Springer
132views Database» more  BTW 2009»
15 years 5 months ago
A Bayesian Approach to Estimating the Selectivity of Conjunctive Predicates
: Cost-based optimizers in relational databases make use of data statistics to estimate intermediate result cardinalities. Those cardinalities are needed to estimate access plan co...
M. Heimel, Volker Markl, Keshava Murthy
SIGMOD
2010
ACM
173views Database» more  SIGMOD 2010»
15 years 5 months ago
PR-join: a non-blocking join achieving higher early result rate with statistical guarantees
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
Shimin Chen, Phillip B. Gibbons, Suman Nath
ICML
2009
IEEE
16 years 1 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...
CHI
2006
ACM
16 years 25 days ago
Generating automated predictions of behavior strategically adapted to specific performance objectives
It has been well established in Cognitive Psychology that humans are able to strategically adapt performance, even highly skilled performance, to meet explicit task goals such as ...
Katherine Eng, Richard L. Lewis, Irene Tollinger, ...