Sciweavers

16 search results - page 3 / 4
» Specialised Constraints for Stable Matching Problems
Sort
View
AI
2007
Springer
13 years 7 months ago
Computational properties of argument systems satisfying graph-theoretic constraints
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
Paul E. Dunne
FGR
2011
IEEE
271views Biometrics» more  FGR 2011»
12 years 11 months ago
Active conditional models
— Matching images with large geometric and iconic changes (e.g. faces under different poses and facial expressions) is an open research problem in computer vision. There are two ...
Ying Chen, Fernando De la Torre
DAC
2005
ACM
14 years 8 months ago
A quasi-convex optimization approach to parameterized model order reduction
In this paper an optimization based model order reduction (MOR) framework is proposed. The method involves setting up a quasiconvex program that explicitly minimizes a relaxation ...
Kin Cheong Sou, Alexandre Megretski, Luca Daniel
FOCS
2009
IEEE
14 years 2 months ago
Reducibility among Fractional Stability Problems
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
Shiva Kintali, Laura J. Poplawski, Rajmohan Rajara...
ICPR
2008
IEEE
14 years 1 months ago
Non-rigid image registration based on the globally optimized correspondences
In this paper, we propose a new approach to the non-rigid image registration. This problem can be easily attacked if we can find regularly distributed correspondence points over ...
Hyung il Koo, Jung Gap Kuk, Nam Ik Cho