Sciweavers

210 search results - page 16 / 42
» Considering Ill-Definedness of Problems from the Aspect of S...
Sort
View
NIPS
2004
13 years 8 months ago
Semi-supervised Learning by Entropy Minimization
We consider the semi-supervised learning problem, where a decision rule is to be learned from labeled and unlabeled data. In this framework, we motivate minimum entropy regulariza...
Yves Grandvalet, Yoshua Bengio
DIS
2004
Springer
14 years 24 days ago
Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance
We consider the problem of discovering the optimal pair of substring patterns with bounded distance α, from a given set S of strings. We study two kinds of pattern classes, one is...
Shunsuke Inenaga, Hideo Bannai, Heikki Hyyrö,...
ETFA
2005
IEEE
14 years 1 months ago
Quantized optimal control of discrete-time systems
In this paper we consider a quantized discrete-time linear quadratic regulator (DLQR) problem, namely a DLQR problem where the input u may only take values in a given finite set ...
Daniele Corona, Alessandro Giua, Carla Seatzu
CDC
2010
IEEE
128views Control Systems» more  CDC 2010»
13 years 2 months ago
Greedy sensor selection: Leveraging submodularity
ACT We consider the problem of sensor selection in resource constrained sensor networks. The fusion center selects a subset of k sensors from an available pool of m sensors accordi...
Manohar Shamaiah, Siddhartha Banerjee, Haris Vikal...
MOR
2002
94views more  MOR 2002»
13 years 7 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel