13376 search results - page 214 / 2676 » Problem Solving with |
124
Voted
SCALESPACE
2009
Springer
15 years 10 months ago
2009
Springer
We propose a regularization method for solving ill-posed problems, under the assumption that the solutions are piecewise constant functions with unknown level sets and unknown leve...
143
click to vote
SIAMCOMP
1998
15 years 3 months ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
125
Voted
ICIP
2008
IEEE
15 years 10 months ago
2008
IEEE
In several imaging inverse problems, it may be of interest to encourage the solution to have characteristics which are most naturally expressed by the combination of more than one...
145
Voted
JALC
2002
15 years 3 months ago
2002
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
151
click to vote
DISOPT
2008
15 years 3 months ago
2008
We study a pricing problem where buyers with non-uniform demand purchase one of many items. Each buyer has a known benefit for each item and purchases the item that gives the larg...