Sciweavers

94 search results - page 4 / 19
» Testing Whether a Set of Code Words Satisfies a Given Set of...
Sort
View
ICANN
2003
Springer
14 years 1 months ago
Sparse Coding with Invariance Constraints
We suggest a new approach to optimize the learning of sparse features under the constraints of explicit transformation symmetries imposed on the set of feature vectors. Given a set...
Heiko Wersing, Julian Eggert, Edgar Körner
LREC
2008
120views Education» more  LREC 2008»
13 years 9 months ago
Division of Example Sentences Based on the Meaning of a Target Word Using Semi-Supervised Clustering
In this paper, we describe a system that divides example sentences (data set) into clusters, based on the meaning of the target word, using a semi-supervised clustering technique....
Hiroyuki Shinnou, Minoru Sasaki
GD
2006
Springer
13 years 11 months ago
Planarity Testing and Optimal Edge Insertion with Embedding Constraints
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
Carsten Gutwenger, Karsten Klein, Petra Mutzel
TIT
2002
107views more  TIT 2002»
13 years 7 months ago
Constrained systems with unconstrained positions
We develop methods for analyzing and constructing combined modulation/error-correctiong codes (ECC codes), in particular codes that employ some form of reversed concatenation and w...
Jorge Campello de Souza, Brian H. Marcus, Richard ...
AMAI
2002
Springer
13 years 8 months ago
An Empirical Test of Patterns for Nonmonotonic Inference
: It is claimed that human inferential apparatus offers interesting ground in order to consider the intuitions of artificial intelligence researchers about the inference patterns a...
Rui Da Silva Neves, Jean-François Bonnefon,...