4843 search results - page 228 / 969 » The Shortcut Problem - Complexity and Approximation |
105
click to vote
TACAS
2005
Springer
15 years 9 months ago
2005
Springer
This paper addresses the problem of generating symbolic test cases for testing the conformance of a black-box implementation with respect to a specification, in the context of rea...
184
Voted
STOC
1998
ACM
15 years 7 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
125
click to vote
SIAMCOMP
2008
15 years 3 months ago
2008
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
146
Voted
CVPR
2010
IEEE
15 years 1 months ago
2010
IEEE
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
169
Voted
WINE
2010
Springer
15 years 1 months ago
2010
Springer
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...