370 search results - page 10 / 74 » Bounded modified realizability |
CATS
2006
13 years 10 months ago
2006
We investigate a scheduling problem motivated by pull-based data delivering systems where there is a server keeping a number of pages; and clients requesting the same page can be ...
VLDB
2006
ACM
14 years 8 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
JSYML
2010
13 years 3 months ago
2010
We say a countable model A has a 0-basis if the types realized in A are uniformly computable. We say A has a (d-)decidable copy if there exists a model B = A such that the element...
NETWORKS
2008
13 years 8 months ago
2008
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
CRYPTO
2005
Springer
14 years 2 months ago
2005
Springer
Since bit and string oblivious transfer and commitment, two primitives of paramount importance in secure two- and multi-party computation, cannot be realized in an unconditionally ...