Sciweavers

3006 search results - page 359 / 602
» Dimensionality reduction and generalization
Sort
View
MFCS
2007
Springer
16 years 24 days ago
Hardness Results for Tournament Isomorphism and Automorphism
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
Fabian Wagner
DDECS
2006
IEEE
79views Hardware» more  DDECS 2006»
16 years 21 days ago
Multiple-Vector Column-Matching BIST Design Method
- Extension of a BIST design algorithm is proposed in this paper. The method is based on a synthesis of a combinational block - the decoder, transforming pseudo-random code words i...
Petr Fiser, Hana Kubatova
ICMCS
2006
IEEE
108views Multimedia» more  ICMCS 2006»
16 years 21 days ago
Optimized Chamfer Matching for Snake-Based Image Contour Representations
In this paper we present a novel method on how to take advantage of the snake representation of target objects, when doing chamfer matching for detection/recognition purposes. In ...
András Hajdu, Athanasios Roubies, Ioannis P...
IJCNN
2006
IEEE
16 years 20 days ago
Ensemble of Neural Network Emulations for Climate Model Physics: The Impact on Climate Simulations
—A new application of the NN ensemble approach is presented. It is applied to NN emulations of model physics in complex numerical climate models, and aimed at improving the accur...
Michael S. Fox-Rabinovitz, Vladimir M. Krasnopolsk...
COMPGEOM
2006
ACM
16 years 19 days ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote