Sciweavers

8294 search results - page 1537 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
15 years 7 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
VMV
2001
131views Visualization» more  VMV 2001»
15 years 4 months ago
Shape Model and Threshold Extraction via Shape Gradients
Shape information is utilized by numerous applications in computer vision, scientific visualization and computer graphics. This paper presents a novel algorithm for exploring and ...
Roger C. Tam, Alain Fournier
CIDM
2009
IEEE
15 years 10 months ago
Ensemble member selection using multi-objective optimization
— Both theory and a wealth of empirical studies have established that ensembles are more accurate than single predictive models. Unfortunately, the problem of how to maximize ens...
Tuve Löfström, Ulf Johansson, Henrik Bos...
VLDB
1999
ACM
140views Database» more  VLDB 1999»
15 years 7 months ago
Combining Histograms and Parametric Curve Fitting for Feedback-Driven Query Result-size Estimation
This paper aims to improve the accuracy of query result-size estimations in query optimizers by leveraging the dynamic feedback obtained from observations on the executed query wo...
Arnd Christian König, Gerhard Weikum
ALMOB
2008
85views more  ALMOB 2008»
15 years 3 months ago
Noisy: Identification of problematic columns in multiple sequence alignments
Motivation: Sequence-based methods for phylogenetic reconstruction from (nucleic acid) sequence data are notoriously plagued by two effects: homoplasies and alignment errors. Larg...
Andreas W. M. Dress, Christoph Flamm, Guido Fritzs...
« Prev « First page 1537 / 1659 Last » Next »