Sciweavers

1749 search results - page 335 / 350
» An ICA algorithm for analyzing multiple data sets
Sort
View
KDD
2007
ACM
169views Data Mining» more  KDD 2007»
14 years 8 months ago
Exploiting underrepresented query aspects for automatic query expansion
Users attempt to express their search goals through web search queries. When a search goal has multiple components or aspects, documents that represent all the aspects are likely ...
Daniel Crabtree, Peter Andreae, Xiaoying Gao
CIKM
2009
Springer
14 years 16 days ago
Space-economical partial gram indices for exact substring matching
Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...
Nan Tang, Lefteris Sidirourgos, Peter A. Boncz
SIGMOD
2011
ACM
202views Database» more  SIGMOD 2011»
12 years 10 months ago
Sensitivity analysis and explanations for robust query evaluation in probabilistic databases
Probabilistic database systems have successfully established themselves as a tool for managing uncertain data. However, much of the research in this area has focused on efficient...
Bhargav Kanagal, Jian Li, Amol Deshpande
BMCBI
2008
211views more  BMCBI 2008»
13 years 8 months ago
CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment
Background: Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more t...
Svetlin Manavski, Giorgio Valle
ATAL
2007
Springer
13 years 12 months ago
Confidence-based policy learning from demonstration using Gaussian mixture models
We contribute an approach for interactive policy learning through expert demonstration that allows an agent to actively request and effectively represent demonstration examples. I...
Sonia Chernova, Manuela M. Veloso