Sciweavers

2436 search results - page 436 / 488
» Evaluating Adaptive Problem Selection
Sort
View
WWW
2005
ACM
14 years 9 months ago
Three-level caching for efficient query processing in large Web search engines
Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple...
Xiaohui Long, Torsten Suel
EDBT
2009
ACM
106views Database» more  EDBT 2009»
14 years 18 days ago
AlphaSum: size-constrained table summarization using value lattices
Consider a scientist who wants to explore multiple data sets to select the relevant ones for further analysis. Since the visualization real estate may put a stringent constraint o...
K. Selçuk Candan, Huiping Cao, Yan Qi 0002,...
IJCAI
1997
13 years 10 months ago
Is Nonparametric Learning Practical in Very High Dimensional Spaces?
Many of the challenges faced by the £eld of Computational Intelligence in building intelligent agents, involve determining mappings between numerous and varied sensor inputs and ...
Gregory Z. Grudic, Peter D. Lawrence
BMCBI
2007
121views more  BMCBI 2007»
13 years 8 months ago
A constrained polynomial regression procedure for estimating the local False Discovery Rate
Background: In the context of genomic association studies, for which a large number of statistical tests are performed simultaneously, the local False Discovery Rate (lFDR), which...
Cyril Dalmasso, Avner Bar-Hen, Philippe Broët
BMCBI
2007
145views more  BMCBI 2007»
13 years 8 months ago
Improved benchmarks for computational motif discovery
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
Geir Kjetil Sandve, Osman Abul, Vegard Walseng, Fi...