Sciweavers

42230 search results - page 136 / 8446
» Algorithms and Complexity Results for
Sort
View
EDBT
1994
ACM
149views Database» more  EDBT 1994»
15 years 2 months ago
On the Estimation of Join Result Sizes
Abstract. Good estimates of join result sizes are critical for query optimization in relational database management systems. We address the problem of incrementally obtaining accur...
Arun N. Swami, K. Bernhard Schiefer
NIPS
1992
14 years 11 months ago
Feudal Reinforcement Learning
This paper describes the adaption and application of an algorithm called Feudal Reinforcement Learning to a complex gridworld navigation problem. The algorithm proved to be not ea...
Peter Dayan, Geoffrey E. Hinton
BMCBI
2008
108views more  BMCBI 2008»
14 years 10 months ago
A nonparametric model for quality control of database search results in shotgun proteomics
Background: Analysis of complex samples with tandem mass spectrometry (MS/MS) has become routine in proteomic research. However, validation of database search results creates a bo...
Jiyang Zhang, Jianqi Li, Xin Liu, Hongwei Xie, Yun...
ICALP
2007
Springer
15 years 4 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
LOGCOM
2006
90views more  LOGCOM 2006»
14 years 10 months ago
Transfer Results for Hybrid Logic. Part I: The Case Without Satisfaction Operators
For every Kripke complete modal logic L we define its hybrid companion LH . For a reasonable class of logics, we present a satisfiability-preserving translation from LH to L. We p...
Nick Bezhanishvili, Balder ten Cate