14548 search results - page 295 / 2910 » The Optimal Path-Matching Problem |
211
click to vote
SOFSEM
2012
Springer
14 years 2 months ago
2012
Springer
The classical group testing problem asks to determine at most d defective elements in a set of n elements, by queries to subsets that return Yes if the subset contains some defecti...
190
click to vote
MCM
2011
15 years 1 months ago
2011
When filtering through a wall with constant averaging radius, in addition to the subfilter scale stresses, a non-closed commutator term arises. We consider a proposal of Das and ...
167
click to vote
CL
1999
Springer
15 years 6 months ago
1999
Springer
It is well known that dynamic typing in languages like Lisp is costly in terms of performance. Besides the cost of tag checking, the other major source of ine ciency comes from th...
201
click to vote
PAMI
2007
15 years 6 months ago
2007
—This paper presents a novel approach for estimating the parameters for MRF-based stereo algorithms. This approach is based on a new formulation of stereo as a maximum a posterio...
159
click to vote
JOTA
2010
15 years 5 months ago
2010
We consider a distributed multi-agent network system where the goal is to minimize a sum of agent objective functions subject to a common set of constraints. For this problem, we p...