941 search results - page 60 / 189 » Efficient Testing of Large Graphs |
104
click to vote
ICCV
2007
IEEE
15 years 1 months ago
2007
IEEE
In many computer vision applications, such as face recognition and hand pose estimation, we need systems that can recognize a very large number of classes. Large margin classifica...
105
click to vote
SIAMSC
2008
14 years 9 months ago
2008
In a recent paper, the authors introduced the recovery method resp. local energy matching principle for solving large systems of lattice equations. The idea is to construct a part...
CIDM
2007
IEEE
15 years 1 months ago
2007
IEEE
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper we study how to improve nearest neighbor classification by learning a Mahalanobis distance metric. We build on a recently proposed framework for distance metric lear...
54
Voted
GECCO
2003
Springer
15 years 3 months ago
2003
Springer
This paper suggests dense and switched modular primitives for a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynam...