Sciweavers

10271 search results - page 528 / 2055
» Computer Science
Sort
View
FOCS
1999
IEEE
15 years 11 months ago
A Sublinear Time Approximation Scheme for Clustering in Metric Spaces
The metric 2-clustering problem is de ned as follows: given a metric (X;d), partition X into two sets S1 and S2 in order to minimize the value of X i X fu;vg Si d(u;v) In this pap...
Piotr Indyk
FOCS
1999
IEEE
15 years 11 months ago
On the Complexity of SAT
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...
Richard J. Lipton, Anastasios Viglas
CAIP
1999
Springer
190views Image Analysis» more  CAIP 1999»
15 years 11 months ago
Image Stitching - Comparisons and New Techniques
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 ...
Chia-Yen Chen, Reinhard Klette
ERSHOV
1999
Springer
15 years 11 months ago
Twin - A Design Pattern for Modeling Multiple Inheritance
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...
Hanspeter Mössenböck
FOCS
1998
IEEE
15 years 11 months ago
The Quantum Communication Complexity of Sampling
Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X
Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shm...