2200 search results - page 393 / 440 » Bloch's Constant is Computable |
100
click to vote
TAMC
2009
Springer
15 years 2 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
Extractors (defined by Nisan and Zuckerman) are procedures that use a small number of truly random bits (called the seed) to extract many (almost) truly random bits from arbitrar...
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
SIGGRAPH
2000
ACM
15 years 2 months ago
2000
ACM
This paper studies the problem of plenoptic sampling in imagebased rendering (IBR). From a spectral analysis of light field signals and using the sampling theorem, we mathematica...
114
click to vote
SPAA
1999
ACM
15 years 2 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...