6315 search results - page 111 / 1263 » Approximating Solution Structure |
138
click to vote
UAI
1992
15 years 4 months ago
1992
In this paper, a unified framework for representing uncertain information based on the notion of an interval structure is proposed. It is shown that the lower and upper approximat...
133
click to vote
DAM
1999
15 years 2 months ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
123
click to vote
JACM
2000
15 years 2 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
138
click to vote
ECCV
2004
Springer
16 years 4 months ago
2004
Springer
We analyze the least?squares error for structure from motion with a single infinitesimal motion ("structure from optical flow"). We present asymptotic approximations to ...
150
click to vote
DAC
2006
ACM
16 years 4 months ago
2006
ACM
In this paper, we propose an exact algorithm for the problem of area optimization under a delay constraint in the synthesis of multiplierless FIR filters. To the best of our knowl...