Sciweavers

5595 search results - page 468 / 1119
» Comparing Subsumption Optimizations
Sort
View
ISCI
2008
102views more  ISCI 2008»
15 years 7 months ago
Random walk biclustering for microarray data
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rand...
Fabrizio Angiulli, Eugenio Cesario, Clara Pizzuti
CORR
2007
Springer
107views Education» more  CORR 2007»
15 years 7 months ago
Functional Multi-Layer Perceptron: a Nonlinear Tool for Functional Data Analysis
In this paper, we study a natural extension of Multi-Layer Perceptrons (MLP) to functional inputs. We show that fundamental results for classical MLP can be extended to functional...
Fabrice Rossi, Brieuc Conan-Guez
JMLR
2006
107views more  JMLR 2006»
15 years 7 months ago
Bounds for the Loss in Probability of Correct Classification Under Model Based Approximation
In many pattern recognition/classification problem the true class conditional model and class probabilities are approximated for reasons of reducing complexity and/or of statistic...
Magnus Ekdahl, Timo Koski
233
Voted
AIR
2005
130views more  AIR 2005»
15 years 7 months ago
Framework for Task Scheduling in Heterogeneous Distributed Computing Using Genetic Algorithms
An algorithm has been developed to dynamically schedule heterogeneous tasks on heterogeneous processors in a distributed system. The scheduler operates in an environment with dynam...
Andrew J. Page, Thomas J. Naughton
TCS
2008
15 years 7 months ago
Finding a minimum medial axis of a discrete shape is NP-hard
The medial axis is a classical representation of digital objects widely used in many applications. However, such a set of balls may not be optimal: subsets of the medial axis may ...
David Coeurjolly, Jérôme Hulin, Isabe...