Sciweavers

3823 search results - page 348 / 765
» Experiments with Random Projection
Sort
View
COR
2010
146views more  COR 2010»
15 years 4 months ago
A search space "cartography" for guiding graph coloring heuristics
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
ITA
2006
163views Communications» more  ITA 2006»
15 years 4 months ago
Graph fibrations, graph isomorphism, and PageRank
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
Paolo Boldi, Violetta Lonati, Massimo Santini, Seb...
BMCBI
2005
140views more  BMCBI 2005»
15 years 4 months ago
JACOP: A simple and robust method for the automated classification of protein sequences with modular architecture
Background: Whole-genome sequencing projects are rapidly producing an enormous number of new sequences. Consequently almost every family of proteins now contains hundreds of membe...
Peter Sperisen, Marco Pagni
NN
2000
Springer
177views Neural Networks» more  NN 2000»
15 years 4 months ago
Independent component analysis: algorithms and applications
A fundamental problem in neural network research, as well as in many other disciplines, is finding a suitable representation of multivariate data, i.e. random vectors. For reasons...
Aapo Hyvärinen, Erkki Oja
IEE
2002
72views more  IEE 2002»
15 years 4 months ago
Making inferences with small numbers of training sets
This paper discusses a potential methodological problem with empirical studies assessing project effort prediction systems. Frequently a hold-out strategy is deployed so that the ...
Colin Kirsopp, Martin J. Shepperd