Sciweavers

395 search results - page 77 / 79
» Towards a theory of search queries
Sort
View
SIGIR
2003
ACM
14 years 27 days ago
Evaluating different methods of estimating retrieval quality for resource selection
In a federated digital library system, it is too expensive to query every accessible library. Resource selection is the task to decide to which libraries a query should be routed....
Henrik Nottelmann, Norbert Fuhr
BMCBI
2004
190views more  BMCBI 2004»
13 years 7 months ago
RAG: RNA-As-Graphs web resource
Background: The proliferation of structural and functional studies of RNA has revealed an increasing range of RNA's structural repertoire. Toward the objective of systematic ...
Daniela Fera, Namhee Kim, Nahum Shiffeldrim, Julie...
ATAL
2011
Springer
12 years 7 months ago
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe
CCS
2009
ACM
14 years 2 months ago
Privacy-preserving genomic computation through program specialization
In this paper, we present a new approach to performing important classes of genomic computations (e.g., search for homologous genes) that makes a significant step towards privacy...
Rui Wang, XiaoFeng Wang, Zhou Li, Haixu Tang, Mich...
BMCBI
2006
123views more  BMCBI 2006»
13 years 7 months ago
An Automated Method for Rapid Identification of Putative Gene Family Members in Plants
Background: Gene duplication events have played a significant role in genome evolution, particularly in plants. Exhaustive searches for all members of a known gene family as well ...
Ronald L. Frank, Ajay Mane, Fikret Erçal