Sciweavers

1525 search results - page 134 / 305
» Matching with Regular Constraints
Sort
View
TNN
2008
129views more  TNN 2008»
15 years 4 months ago
Data Visualization and Dimensionality Reduction Using Kernel Maps With a Reference Point
In this paper, a new kernel-based method for data visualization and dimensionality reduction is proposed. A reference point is considered corresponding to additional constraints ta...
Johan A. K. Suykens
CORR
2012
Springer
220views Education» more  CORR 2012»
13 years 12 months ago
Sparse Topical Coding
We present sparse topical coding (STC), a non-probabilistic formulation of topic models for discovering latent representations of large collections of data. Unlike probabilistic t...
Jun Zhu, Eric P. Xing
ECCV
2008
Springer
16 years 6 months ago
Prior-Based Piecewise-Smooth Segmentation by Template Competitive Deformation Using Partitions of Unity
We propose a new algorithm for two-phase, piecewise-smooth segmentation with shape prior. The image is segmented by a binary template that is deformed by a regular geometric transf...
Benoit Mory, Laurent D. Cohen, Oudom Somphone, Sh&...
137
Voted
ICCAD
2006
IEEE
139views Hardware» more  ICCAD 2006»
16 years 1 months ago
Analog placement with symmetry and other placement constraints
In order to handle device matching in analog circuits, some pairs of modules are required to be placed symmetrically. This paper addresses this device-level placement problem for ...
Yiu-Cheong Tam, Evangeline F. Y. Young, Chris C. N...
148
Voted
ENTCS
2006
183views more  ENTCS 2006»
15 years 4 months ago
Metamodel-Based Model Transformation with Aspect-Oriented Constraints
Model transformation means converting an input model available at the beginning of the transformation process to an output model. A widely used approach to model transformation us...
László Lengyel, Tihamer Levendovszky...