Sciweavers

1458 search results - page 113 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
BMCBI
2010
132views more  BMCBI 2010»
15 years 6 months ago
Data structures and compression algorithms for high-throughput sequencing technologies
Background: High-throughput sequencing (HTS) technologies play important roles in the life sciences by allowing the rapid parallel sequencing of very large numbers of relatively s...
Kenny Daily, Paul Rigor, Scott Christley, Xiaohui ...
JAPLL
2007
101views more  JAPLL 2007»
15 years 6 months ago
Data-driven type checking in open domain question answering
Many open domain question answering systems answer questions by first harvesting a large number of candidate answers, and then picking the most promising one from the list. One c...
Stefan Schlobach, David Ahn, Maarten de Rijke, Val...
WAIM
2009
Springer
15 years 10 months ago
Kernel-Based Transductive Learning with Nearest Neighbors
In the k-nearest neighbor (KNN) classifier, nearest neighbors involve only labeled data. That makes it inappropriate for the data set that includes very few labeled data. In this ...
Liangcai Shu, Jinhui Wu, Lei Yu, Weiyi Meng
ICCV
2011
IEEE
14 years 6 months ago
Feature Seeding for Action Recognition
Progress in action recognition has been in large part due to advances in the features that drive learning-based methods. However, the relative sparsity of training data and the ri...
Pyry Matikainen, Rahul Sukthankar, Martial Hebert
BMCBI
2007
105views more  BMCBI 2007»
15 years 6 months ago
Text-derived concept profiles support assessment of DNA microarray data for acute myeloid leukemia and for androgen receptor sti
Background: High-throughput experiments, such as with DNA microarrays, typically result in hundreds of genes potentially relevant to the process under study, rendering the interpr...
Rob Jelier, Guido Jenster, Lambert C. J. Dorssers,...