1525 search results - page 47 / 305 » Matching with Regular Constraints |
200
click to vote
CVPR
2009
IEEE
17 years 18 days ago
2009
IEEE
Feature selection plays a fundamental role in many pattern
recognition problems. However, most efforts have been
focused on the supervised scenario, while unsupervised feature
s...
164
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
This article deals with a regularized version of the split gradient method (SGM), leading to multiplicative algorithms. The proposed algorithm is available for the optimization of...
125
Voted
ENTCS
2006
15 years 5 months ago
2006
Context and sequence variables allow matching to explore term-trees both in depth and in breadth. It makes context sequence matching a suitable computational mechanism for a rule-...
153
click to vote
IWPC
2000
IEEE
15 years 10 months ago
2000
IEEE
This paper presents a framework for software architecture recovery and restructuring. The user specifies a high level abstraction view of the system using a structured pattern la...
137
click to vote
MOR
2006
15 years 5 months ago
2006
For a locally optimal solution to the nonlinear semidefinite programming problem, under Robinson's constraint qualification, the following conditions are proved to be equival...