3690 search results - page 207 / 738 » Computation with classical sequents |
105
Voted
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Scene categorization is a fundamental problem in computer vision. However, scene understanding research has been constrained by the limited scope of currently-used databases which...
120
Voted
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
83
Voted
CSR
2007
Springer
15 years 6 months ago
2007
Springer
We investigate the complexity of equivalence problems for {∪, ∩, − , +, ×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer an...
127
click to vote
ICICIC
2006
IEEE
15 years 6 months ago
2006
IEEE
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
101
Voted
WABI
2005
Springer
15 years 6 months ago
2005
Springer
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...