Sciweavers

12194 search results - page 2215 / 2439
» Numberings Optimal for Learning
Sort
View
BTW
2009
Springer
132views Database» more  BTW 2009»
15 years 11 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
ICS
2009
Tsinghua U.
15 years 11 months ago
A translation system for enabling data mining applications on GPUs
Modern GPUs offer much computing power at a very modest cost. Even though CUDA and other related recent developments are accelerating the use of GPUs for general purpose applicati...
Wenjing Ma, Gagan Agrawal
ESOP
2001
Springer
15 years 11 months ago
On the Complexity of Constant Propagation
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
Markus Müller-Olm, Oliver Rüthing
191
Voted
ICCS
2001
Springer
15 years 11 months ago
High-Performance Algorithm Engineering for Computational Phylogenetics
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
Bernard M. E. Moret, David A. Bader, Tandy Warnow
187
Voted
FOCS
2000
IEEE
15 years 11 months ago
Extracting Randomness via Repeated Condensing
Extractors (defined by Nisan and Zuckerman) are procedures that use a small number of truly random bits (called the seed) to extract many (almost) truly random bits from arbitrar...
Omer Reingold, Ronen Shaltiel, Avi Wigderson
« Prev « First page 2215 / 2439 Last » Next »