Sciweavers

2899 search results - page 469 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
ALT
2007
Springer
15 years 7 months ago
On Universal Transfer Learning
In transfer learning the aim is to solve new learning tasks using fewer examples by using information gained from solving related tasks. Existing transfer learning methods have be...
M. M. Hassan Mahmud
ICALP
2005
Springer
15 years 7 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 5 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
15 years 2 months ago
Evolutionary swarm design of architectural idea models
In this paper we present a swarm grammar system that makes use of bio-inspired mechanisms of reproduction, communication and construction in order to build three-dimensional struc...
Sebastian von Mammen, Christian Jacob
BMCBI
2006
110views more  BMCBI 2006»
15 years 1 months ago
Design of a combinatorial DNA microarray for protein-DNA interaction studies
Background: Discovery of precise specificity of transcription factors is an important step on the way to understanding the complex mechanisms of gene regulation in eukaryotes. Rec...
Julian Mintseris, Michael B. Eisen