Sciweavers

1576 search results - page 105 / 316
» Properties of Synthetic Optimization Problems
Sort
View
INFOCOM
2010
IEEE
15 years 2 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller
PAMI
2011
14 years 11 months ago
Linear Local Models for Monocular Reconstruction of Deformable Surfaces
—Recovering the 3D shape of a nonrigid surface from a single viewpoint is known to be both ambiguous and challenging. Resolving the ambiguities typically requires prior knowledge...
Mathieu Salzmann, Pascal Fua
JMLR
2012
13 years 6 months ago
Exploiting Unrelated Tasks in Multi-Task Learning
We study the problem of learning a group of principal tasks using a group of auxiliary tasks, unrelated to the principal ones. In many applications, joint learning of unrelated ta...
Bernardino Romera-Paredes, Andreas Argyriou, Nadia...
ICML
2006
IEEE
16 years 4 months ago
Active learning via transductive experimental design
This paper considers the problem of selecting the most informative experiments x to get measurements y for learning a regression model y = f(x). We propose a novel and simple conc...
Kai Yu, Jinbo Bi, Volker Tresp
GECCO
2000
Springer
112views Optimization» more  GECCO 2000»
15 years 7 months ago
Code Compaction Using Genetic Algorithms
One method for compacting executable computer code is to replace commonly repeated sequences of instructions with macro instructions from a decoding dictionary. The size of the de...
Keith E. Mathias, Larry J. Eshelman, J. David Scha...