2412 search results - page 399 / 483 » Which Problems Have Strongly Exponential Complexity |
PAMI
2010
13 years 6 months ago
2010
—Shortest paths have been used to segment object boundaries with both continuous and discrete image models. Although these techniques are well defined in 2D, the character of the...
CGF
2011
12 years 11 months ago
2011
Recently, the problem of intrinsic shape matching has received a lot of attention. A number of algorithms have been proposed, among which random-sampling-based techniques have bee...
WWW
2004
ACM
14 years 8 months ago
2004
ACM
The overwhelming success of the Web as a mechanism for facilitating information retrieval and for conducting business transactions has led to an increase in the deployment of comp...
ICSE
2003
IEEE-ACM
14 years 7 months ago
2003
IEEE-ACM
The knowledge required to develop complex software has historically existed in programming folklore, the heads of experienced developers, or buried deep in the code. These locatio...
SIGECOM
2010
ACM
14 years 16 days ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...