2064 search results - page 217 / 413 » Segmentation Problems |
207
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
A dynamic texture is a generative model for video that
treats the video as a sample from spatio-temporal stochastic
process. One problem associated with the dynamic texture
is t...
148
click to vote
ISPD
1999
ACM
15 years 10 months ago
1999
ACM
—This paper studies a natural formulation of the timing-driven maze routing problem. A multigraph model appropriate for global routing applications is adopted; the model naturall...
154
click to vote
ISPD
2000
ACM
15 years 11 months ago
2000
ACM
We address the problem of computing critical area for missing material defects in a circuit layout. The extraction of critical area is the main computational problem in VLSI yield...
230
click to vote
ESANN
2000
15 years 7 months ago
2000
Abstract. In this paper, we presen t an algorithm that provides adaptive plasticity in function approximation problems: the deformable (feature) map (DM) algorithm. The DM approach...
167
click to vote
NIPS
2004
15 years 7 months ago
2004
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...