3250 search results - page 412 / 650 » An Algorithm to Solve a Linear Program |
205
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
We present a generalized subgraph preconditioning (GSP) technique to solve large-scale bundle adjustment problems efficiently. In contrast with previous work which uses either di...
163
click to vote
IFIP
2004
Springer
15 years 12 months ago
2004
Springer
We introduce a new synchronization problem in mobile ad-hoc systems: the Driving Philosophers. In this problem, an unbounded number of driving philosophers (processes) access a rou...
161
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
Abstract. Determining shape from stereo has often been posed as a global minimization problem. Once formulated, the minimization problems are then solved with a variety of algorith...
151
click to vote
IWDW
2005
Springer
16 years 1 days ago
2005
Springer
In this paper, we use the previously proposed calibrated DCT features [9] to construct a Support Vector Machine classifier for JPEG images capable of recognizing which steganograp...
170
click to vote
ICALP
1990
Springer
15 years 10 months ago
1990
Springer
We show how (now familiar) hierarchical representations of (convex) polyhedra can be used to answer various separation queries efficiently (in a number of cases, optimally). Our e...