1525 search results - page 124 / 305 » Matching with Regular Constraints |
136
click to vote
JOTA
2011
14 years 11 months ago
2011
In this paper we consider the linear symmetric cone programming (SCP). At a KarushKuhn-Tucker (KKT) point of SCP, we present the important equivalent conditions for the nonsingula...
129
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
Correspondence problems are of great importance in
computer vision. They appear as subtasks in many applications
such as object recognition, merging partial 3D reconstructions
a...
127
click to vote
ANLP
1994
15 years 5 months ago
1994
Given a noisy text page, a word recognizer can generate a set of candidates for each word image. A relaxation algorithm was proposed previously by the authors that uses word collo...
122
click to vote
HEURISTICS
1998
15 years 3 months ago
1998
In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem (SPP). The SPP is an important combinatorial optimisation problem used by man...
178
click to vote
CVPR
2011
IEEE
15 years 6 days ago
2011
IEEE
Color is known to be highly discriminative for many object recognition tasks, but is difficult to infer from uncontrolled images in which the illuminant is not known. Traditional...