11016 search results - page 705 / 2204 » Cloud Computing for Science |
175
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
We show1 that non-deterministic time NTIME(n) is not contained in deterministic time n 2and polylogarithmic space, for any > 0. This implies that (infinitely often) satisfiabi...
204
click to vote
CAIP
1999
Springer
15 years 11 months ago
1999
Springer
In this work, we are mainly dealing with the stitching of panoramic images. However, the methods described and evaluated here can also be used for different applications in image ...
239
click to vote
ERSHOV
1999
Springer
15 years 11 months ago
1999
Springer
We introduce an object-oriented design pattern called Twin that allows us to model multiple inheritance in programming languages that do not support this feature (e.g. Java, Modula...
187
click to vote
FOCS
1998
IEEE
15 years 11 months ago
1998
IEEE
Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X
183
click to vote
RANDOM
1999
Springer
15 years 11 months ago
1999
Springer
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...