4761 search results - page 188 / 953 » Generalizing Boundary Points |
120
Voted
ICIP
2006
IEEE
16 years 5 months ago
2006
IEEE
Recently, it was shown that it is possible to sample classes of 1D and 2-D signals with finite rate of innovation (FRI) [9, 4, 5, 3, 2, 7]. In particular, in [7], we presented loc...
132
click to vote
APPML
2007
15 years 3 months ago
2007
-An edge of a graph H with a perfect matching is a fixed edge if it either belongs to none or to all of the perfect matchings of H. It is shown that a connected plane bipartite gra...
108
click to vote
JC
2006
15 years 3 months ago
2006
We study the information complexity in the randomized setting of solving a general elliptic PDE of order 2m in a smooth, bounded domain Q Rd with smooth coefficients and homogene...
129
click to vote
FAC
2010
15 years 2 months ago
2010
For more than a decade, the trend in geometric constraint systems solving has been to use a geometric decomposition/recombination approach. These methods are generally grounded on...
142
click to vote
PAMI
2010
15 years 2 months ago
2010
—Shortest paths have been used to segment object boundaries with both continuous and discrete image models. Although these techniques are well defined in 2D, the character of the...