Sciweavers

1494 search results - page 28 / 299
» Kernels for Global Constraints
Sort
View
ICASSP
2008
IEEE
15 years 8 months ago
Learning the kernel via convex optimization
The performance of a kernel-based learning algorithm depends very much on the choice of the kernel. Recently, much attention has been paid to the problem of learning the kernel it...
Seung-Jean Kim, Argyrios Zymnis, Alessandro Magnan...
145
Voted
CVPR
2010
IEEE
14 years 11 months ago
Global and local isometry-invariant descriptor for 3D shape comparison and partial matching
In this paper, based on manifold harmonics, we propose a novel framework for 3D shape similarity comparison and partial matching. First, we propose a novel symmetric meanvalue rep...
Huai-Yu Wu, Hongbin Zha, Tao Luo, Xulei Wang, Song...
ICIP
2004
IEEE
16 years 3 months ago
A robust face detector under partial occlusion
This paper presents a robust face detector under partial occlusion. In recent years, the effectiveness of Support Vector Machine (SVM) to object detection is reported. However, co...
Kazuhiro Hotta
105
Voted
CP
2006
Springer
15 years 3 months ago
Graph Properties Based Filtering
Abstract. This report presents a generic filtering scheme, based on the graph description of global constraints. This description is defined by a network of binary constraints and ...
Nicolas Beldiceanu, Mats Carlsson, Sophie Demassey...
96
Voted
SAT
2004
Springer
90views Hardware» more  SAT 2004»
15 years 7 months ago
Encoding Global Unobservability for Efficient Translation to SAT
The paper studies the use of global unobservability constraints in a CNF translation of Boolean formulas, where the unobservability of logic blocks is encoded with CNF unobservabil...
Miroslav N. Velev