464 search results - page 49 / 93 » On the Computational Complexity of Hierarchical Radiosity |
119
click to vote
COMGEO
2000
ACM
14 years 11 months ago
2000
ACM
We present a fast and accurate collision detection algorithm for haptic interaction with polygonal models. Given a model, we pre-compute a hybrid hierarchical representation, cons...
102
click to vote
DAC
1997
ACM
15 years 4 months ago
1997
ACM
Novel test bench techniques are required to cope with a functional test complexity which is predicted to grow much more strongly than design complexity. Our test bench approach at...
109
click to vote
TPDS
2008
14 years 11 months ago
2008
Computational Grids potentially offer low cost, readily available, and large-scale high-performance platforms. For the parallel execution of programs, however, computational GRIDs ...
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
This paper presents algorithms for efficiently computing the covariance matrix for features that form sub-windows in a large multidimensional image. For example, several image proc...
AAAI
2006
15 years 1 months ago
2006
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...