8196 search results - page 89 / 1640 » Computational Modeling and Complexity Science |
CCA
2005
Springer
14 years 11 months ago
2005
Springer
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We draw on the observation that the amount of heat diffusing outside of a heated body in a short period of time is proportional to its surface area, to design a simple algorithm f...
FECS
2007
14 years 11 months ago
2007
Computing professionals are employed in so many different ways that it is difficult to even define the common foundation that all of them should master; however, a single degree ...
CVPR
2003
IEEE
15 years 12 months ago
2003
IEEE
This paper addresses the problem of computing visual hulls from image contours. We propose a new hybrid approach which overcomes the precision-complexity trade-off inherent to vox...
FOCS
1997
IEEE
15 years 2 months ago
1997
IEEE
We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded computation can be made unambiguous. An analogous result holds for the class of pr...