19320 search results - page 315 / 3864 » On the complexity of computing determinants |
157
click to vote
SIGGRAPH
2010
ACM
15 years 11 months ago
2010
ACM
Scenes lit with high dynamic range environment maps of real-world environments exhibit all the complex nuances of natural illumination. For applications that need lighting adjustm...
136
click to vote
ICIP
2004
IEEE
16 years 8 months ago
2004
IEEE
DCT-based CODECs such as MPEG-4 Visual and H.263 "skip" many macroblocks during encoding of typical video sequences (i.e. no coded data is transmitted for these macroblo...
169
click to vote
GD
2007
Springer
16 years 27 days ago
2007
Springer
The odd crossing number of G is the smallest number of pairs of edges that cross an odd number of times in any drawing of G. We show that there always is a drawing realizing the o...
149
click to vote
TGC
2007
Springer
16 years 25 days ago
2007
Springer
We study type systems for termination in the π-calculus from the point of view of type inference. We analyse four systems by Deng and Sangiorgi. We show that inference can be done...
169
click to vote
WG
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...