3368 search results - page 225 / 674 » The Complexity of Query Reliability |
217
click to vote
STOC
2000
ACM
15 years 11 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
185
click to vote
ALT
1995
Springer
15 years 10 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
181
click to vote
SERVICES
2008
15 years 8 months ago
2008
Distributed stream query services must simultaneously process a large number of complex, continuous queries with stringent performance requirements while utilizing distributed pro...
210
click to vote
JACM
2008
15 years 6 months ago
2008
XML queries are usually expressed by means of XPath expressions identifying portions of the selected documents. An XPath expression defines a way of navigating an XML tree and ret...
201
click to vote
TCBB
2010
15 years 1 months ago
2010
Recent techniques increase rapidly the amount of our knowledge on interactions between proteins. The interpretation of these new information depends on our ability to retrieve kno...