13603 search results - page 143 / 2721 » On the Computational Complexity of Cut-Reduction |
139
Voted
BIRTHDAY
2003
Springer
15 years 11 months ago
2003
Springer
The hierarchical radiosity algorithm is an efficient approach to simulation of light with the goal of photo-realistic image rendering. Hanrahan et. al. describe the initialization ...
172
Voted
ICTCS
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
184
Voted
STACS
2001
Springer
15 years 10 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
167
Voted
ICIP
1998
IEEE
16 years 7 months ago
1998
IEEE
Maximum a posteriori (MAP) filtering using the HuberMarkov random field (HMRF) image model has been shown in the past to be an effective method of reducing compression artifacts i...
97
Voted
CIE
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We prove that the one-dimensional sandpile prediction problem is in AC1 . The previously best known upper bound on the ACi -scale was AC2 . We also prove that it is not i...