100 search results - page 5 / 20 » New constructions of weak epsilon-nets |
ICDCS
1995
IEEE
14 years 1 months ago
1995
IEEE
nt formal speci cations of a new abstraction, weak sets, which can be used to alleviate high latencies when retrieving data from a wide-area information system like the World Wide...
TLCA
2007
Springer
14 years 4 months ago
2007
Springer
In our previous work [17] we have shown that for any ω-algebraic meet-cpo D, if all higher-order stable function spaces built from D are ω-algebraic, then D is finitary. This ac...
PLDI
2010
ACM
14 years 2 months ago
2010
ACM
Multi-stage programming (MSP) provides a disciplined approach to run-time code generation. In the purely functional setting, it has been shown how MSP can be used to reduce the ov...
ICALP
2005
Springer
14 years 3 months ago
2005
Springer
Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-r...
JOTA
2010
13 years 4 months ago
2010
We consider multi-objective convex optimal control problems. First we state a relationship between the (weakly or properly) efficient set of the multi-objective problem and the sol...