2200 search results - page 172 / 440 » Bloch's Constant is Computable |
161
click to vote
STACS
2001
Springer
15 years 11 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
148
click to vote
CA
2000
IEEE
15 years 11 months ago
2000
IEEE
We propose the use of high-degree resampling filters for improved temporal antialiasing, or as the result is often called, motion blur. Without temporal antialiasing, strange eff...
153
click to vote
ICCV
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper deals with the concept of auto-calibration, i.e. methods to calibrate a camera on-line. In particular, we deal with minimal conditions on the intrinsic parameters neede...
165
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k durin...
163
click to vote
CGI
1998
IEEE
15 years 10 months ago
1998
IEEE
In this paper we introduce multiresolution analysis (MRA) algorithmsintendedto be used in scientific visualization,and basedon a non-nestedset ofapproximatingspaces. The need for ...