Sciweavers

1169 search results - page 76 / 234
» Degrees of monotone complexity
Sort
View
PODS
2008
ACM
123views Database» more  PODS 2008»
14 years 10 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
FOCS
2009
IEEE
14 years 4 months ago
A Complete Characterization of Statistical Query Learning with Applications to Evolvability
Statistical query (SQ) learning model of Kearns is a natural restriction of the PAC learning model in which a learning algorithm is allowed to obtain estimates of statistical prop...
Vitaly Feldman
RTCSA
2008
IEEE
14 years 4 months ago
Maximizing the Fault Tolerance Capability of Fixed Priority Schedules
Real-time systems typically have to satisfy complex requirements, mapped to the task attributes, eventually guaranteed by the underlying scheduler. These systems consist of a mix ...
Radu Dobrin, Hüseyin Aysan, Sasikumar Punnekk...
SISAP
2008
IEEE
175views Data Mining» more  SISAP 2008»
14 years 4 months ago
Anytime K-Nearest Neighbor Search for Database Applications
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
Weijia Xu, Daniel P. Miranker, Rui Mao, Smriti R. ...
LICS
2007
IEEE
14 years 4 months ago
Symmetric Datalog and Constraint Satisfaction Problems in Logspace
We introduce symmetric Datalog, a syntactic restriction of linear Datalog and show that its expressive power is exactly that of restricted symmetric monotone Krom SNP. The deep re...
László Egri, Benoit Larose, Pascal T...