Uniform characterizations of polynomial-query learnabilities

Author： Hayashi Y.   Matsumoto S.   Shinohara A.   Takeda M.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.292, Iss.2, 2003-01, pp. : 377-385

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Query‐biased summary generation assisted by query expansion

By  

JOURNAL OF THE ASSOCIATION FOR INFORMATION SCIENCE AND TECHNOLOGY, Vol. 66, Iss. 5, 2015-05 ,pp. : 961-979

John Wiley & Sons Inc

Access to resources Recommend Favorite

Hyper-polynomial hierarchies and the polynomial jump

By Fenner  

Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. : 241-256

Elsevier

Access to resources Recommend Favorite

Summary of WWW characterizations

By Pitkow J.E.  

World Wide Web, Vol. 2, Iss. 1-2, 1999-01 ,pp. : 3-13

Springer Publishing Company

Access to resources Recommend Favorite

Query Processing and Optimization on the Web

By Ouzzani Mourad   Bouguettaya Athman  

Distributed and Parallel Databases, Vol. 15, Iss. 3, 2004-05 ,pp. : 187-218

Springer Publishing Company

Access to resources Recommend Favorite

Query processing in sensor networks

By Buchmann Erik  

Distributed and Parallel Databases, Vol. 29, Iss. 1-2, 2011-02 ,pp. : 1-2

Springer Publishing Company

Access to resources Recommend Favorite