13603 search results - page 326 / 2721 » On the Computational Complexity of Cut-Reduction |
159
click to vote
ICCS
2003
Springer
16 years 20 days ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
174
click to vote
COCOON
2009
Springer
16 years 2 months ago
2009
Springer
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...
175
click to vote
CVPR
2001
IEEE
16 years 9 months ago
2001
IEEE
We present a model-based approach to detecting and describing compositions of buildings with complex rooftops. Previous approaches have dealt with either simpler models or models ...
207
click to vote
ICCS
2007
Springer
16 years 1 months ago
2007
Springer
In this work we study the computational complexity of a class of grid Monte Carlo algorithms for integral equations. The idea of the algorithms consists in an approximation of the ...
186
click to vote
VL
2006
IEEE
16 years 1 months ago
2006
IEEE
To explore how people conceptualize a complex system, 232 university students were asked to sketch how a search engine works. While the sketches reveal a diverse range of visual a...