32 search results - page 6 / 7 » Many-to-Many Graph Matching: a Continuous Relaxation Approac... |
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
HYBRID
2001
Springer
13 years 12 months ago
2001
Springer
Efficient algorithms exist for fault detection and isolation of physical systems based on functional redundancy. In a qualitative approach, this redundancy can be captured by a tem...
AMFG
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract. Subspace analysis has been widely used for head pose estimation. However, such techniques are usually sensitive to data alignment and background noise. In this paper a tw...
AI
2008
Springer
13 years 7 months ago
2008
Springer
Dealing with numerical information is practically important in many real-world planning domains where the executability of an action can depend on certain numerical conditions, an...
FLAIRS
2010
13 years 9 months ago
2010
Nowadays, graph-based knowledge discovery algorithms do not consider numeric attributes (they are discarded in the preprocessing step, or they are treated as alphanumeric values w...