3368 search results - page 65 / 674 » The Complexity of Query Reliability |
154
click to vote
LICS
2012
IEEE
13 years 4 months ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
140
click to vote
DILS
2006
Springer
15 years 6 months ago
2006
Springer
The Open Biomedical Ontologies (OBO) is a consortium that serves as a repository of ontologies that are structured like directed acyclic graphs. In this paper we present a language...
ALGORITHMICA
2002
15 years 2 months ago
2002
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
91
Voted
PVLDB
2010
15 years 22 days ago
2010
Mashups integrate a set of Web-services and data sources, often referred to as mashlets. We study in this paper a common scenario where these mashlets are components of larger Web...
110
click to vote
PKDD
2010
Springer
15 years 7 days ago
2010
Springer
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...