Sciweavers

2064 search results - page 217 / 413
» Segmentation Problems
Sort
View
CVPR
2009
IEEE
15 years 6 months ago
Variational Layered Dynamic Textures
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...
Antoni B. Chan, Nuno Vasconcelos
ISPD
1999
ACM
106views Hardware» more  ISPD 1999»
14 years 3 months ago
Timing driven maze routing
—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...
Sung-Woo Hur, Ashok Jagannathan, John Lillis
ISPD
2000
ACM
139views Hardware» more  ISPD 2000»
14 years 3 months ago
Critical area computation for missing material defects in VLSI circuits
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...
Evanthia Papadopoulou
ESANN
2000
14 years 4 days ago
A neural network approach to adaptive pattern analysis - the deformable feature map
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...
Axel Wismüller, Frank Vietze, Dominik R. Ders...
NIPS
2004
14 years 5 days ago
Efficient Out-of-Sample Extension of Dominant-Set Clusters
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...
Massimiliano Pavan, Marcello Pelillo