Sciweavers

4103 search results - page 190 / 821
» Some results on the Collatz problem
Sort
View
167
Voted
CIARP
2005
Springer
16 years 6 days ago
Classifier Selection Based on Data Complexity Measures
Tin Kam Ho and Ester Bernardò Mansilla in 2004 proposed to use data complexity measures to determine the domain of competition of the classifiers. They applied different classifie...
Edith Hernández-Reyes, Jesús Ariel C...
EPIA
2005
Springer
16 years 6 days ago
CATRAPILAS - A Simple Robotic Platform
This paper describes Catrapilas, a small robotic platform, designed to be capable of solving some well known robot problems. Among these are some of the most popular robotic contes...
Nuno Cerqueira
SG
2005
Springer
16 years 4 days ago
A Smart Algorithm for Column Chart Labeling
This paper presents a smart algorithm for labeling column charts and their derivatives. To efficiently solve the problem, we separate it into two sub-problems. We first present a ...
Sebastian Müller, Arno Schödl
WIRN
2005
Springer
16 years 4 days ago
Recursive Neural Networks and Graphs: Dealing with Cycles
Recursive neural networks are a powerful tool for processing structured data. According to the recursive learning paradigm, the input information consists of directed positional ac...
Monica Bianchini, Marco Gori, Lorenzo Sarti, Franc...
CPM
2004
Springer
110views Combinatorics» more  CPM 2004»
16 years 2 days ago
Finding Biclusters by Random Projections
Given a matrix X composed of symbols, a bicluster is a submatrix of X obtained by removing some of the rows and some of the columns of X in such a way that each row of what is lef...
Stefano Lonardi, Wojciech Szpankowski, Qiaofeng Ya...