298 search results - page 8 / 60 » Simplicity in Solving the Frame Problem |
TPHOL
2007
IEEE
14 years 1 months ago
2007
IEEE
We present a simple method to formally prove termination of recursive functions by searching for lexicographic combinations of size measures. Despite its simplicity, the method tur...
SIAMCOMP
1998
13 years 7 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 ...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
This paper concerns the reconstruction of a temporally-varying scene from a video sequence of noisy linear projections. Assuming that each video frame is sparse or compressible in...
NA
2010
13 years 6 months ago
2010
In the past decade or so, semi-definite programming (SDP) has emerged as a powerful tool capable of handling a remarkably wide range of problems. This article describes an innovat...
EMMCVPR
2011
Springer
12 years 7 months ago
2011
Springer
Abstract. This paper proposes an algorithm for image segmentation using GraphCuts which can be used to efficiently solve labeling problems on high resolution images or resource-lim...