19320 search results - page 200 / 3864 » On the complexity of computing determinants |
185
click to vote
ICCSA
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
165
click to vote
RT
1995
Springer
15 years 10 months ago
1995
Springer
We describe a new framework for efficiently computing and storing global illumination effects for complex, animated environments. The new framework allows the rapid generation of ...
142
click to vote
CSL
2007
Springer
16 years 22 days ago
2007
Springer
Recently it has been shown that the miniaturization mapping M faithfully translates subexponential parameterized complexity into (unbounded) parameterized complexity. We determine...
147
click to vote
TPDS
2008
15 years 6 months ago
2008
Efficient key distribution is an important problem for secure group communications. The communication and storage complexity of multicast key distribution problem has been studied ...
332
click to vote
SIGCSE
2006
ACM
16 years 15 days ago
2006
ACM
The statistics show that the number of Computer Science majors is dropping across the United States. Possible reasons include a reduced number of jobs in the field, an incorrect p...