Sciweavers

1679 search results - page 7 / 336
» Pointcuts as Functional Queries
Sort
View
PVLDB
2010
110views more  PVLDB 2010»
13 years 5 months ago
Read-Once Functions and Query Evaluation in Probabilistic Databases
Probabilistic databases hold promise of being a viable means for large-scale uncertainty management, increasingly needed in a number of real world applications domains. However, q...
Prithviraj Sen, Amol Deshpande, Lise Getoor
TOC
2010
127views Management» more  TOC 2010»
13 years 2 months ago
The Submodular Welfare Problem with Demand Queries
: We consider the Submodular Welfare Problem where we have m items and n players with given utility functions wi : 2[m] R+. The utility functions are assumed to be monotone and su...
Uriel Feige, Jan Vondrák
COCO
2001
Springer
108views Algorithms» more  COCO 2001»
13 years 12 months ago
Bounded Query Functions with Limited Output Bits
This paper explores the difference between parallel and serial queries to an NP-complete oracle, SAT, from the perspective of functions with a limited number of output bits. For ...
Richard Chang, Jon S. Squire
NAR
2010
107views more  NAR 2010»
13 years 2 months ago
PLAST-ncRNA: Partition function Local Alignment Search Tool for non-coding RNA sequences
Alignment-based programs are valuable tools for finding potential homologs in genome sequences. Previously, it has been shown that partition function posterior probabilities attun...
Satish Chikkagoudar, Dennis R. Livesay, Usman Rosh...
ECIR
2007
Springer
13 years 8 months ago
Query Hardness Estimation Using Jensen-Shannon Divergence Among Multiple Scoring Functions
We consider the issue of query performance, and we propose a novel method for automatically predicting the difficulty of a query. Unlike a number of existing techniques which are b...
Javed A. Aslam, Virgiliu Pavlu