Sciweavers

933 search results - page 71 / 187
» Monotone Complexity of a Pair
Sort
View
FOCS
2009
IEEE
14 years 3 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 3 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 3 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 3 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...
ICTAI
2006
IEEE
14 years 2 months ago
Sustained Emerging Spatio-Temporal Co-occurrence Pattern Mining: A Summary of Results
Sustained emerging spatio-temporal co-occurrence patterns (SECOPs) represent subsets of object-types that are increasingly located together in space and time. Discovering SECOPs i...
Mete Celik, Shashi Shekhar, James P. Rogers, James...