Sciweavers

1180 search results - page 214 / 236
» An Instance Selection Approach to Multiple Instance Learning
Sort
View
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
14 years 9 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes
CIKM
2009
Springer
14 years 3 months ago
Evaluating top-k queries over incomplete data streams
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
Parisa Haghani, Sebastian Michel, Karl Aberer
AAAI
2010
13 years 9 months ago
Computing Cost-Optimal Definitely Discriminating Tests
The goal of testing is to discriminate between multiple hypotheses about a system--for example, different fault diagnoses--by applying input patterns and verifying or falsifying t...
Anika Schumann, Jinbo Huang, Martin Sachenbacher
BMCBI
2006
195views more  BMCBI 2006»
13 years 8 months ago
Hubs of knowledge: using the functional link structure in Biozon to mine for biologically significant entities
Background: Existing biological databases support a variety of queries such as keyword or definition search. However, they do not provide any measure of relevance for the instance...
Paul Shafer, Timothy Isganitis, Golan Yona
WWW
2011
ACM
13 years 3 months ago
Search result diversity for informational queries
Ambiguous queries constitute a significant fraction of search instances and pose real challenges to web search engines. With current approaches the top results for these queries ...
Michael J. Welch, Junghoo Cho, Christopher Olston