Sciweavers

106 search results - page 19 / 22
» ci 2008
Sort
View
FUIN
2008
71views more  FUIN 2008»
13 years 7 months ago
Nonterminal Complexity of Some Operations on Context-Free Languages
: We investigate context-free languages with respect to the measure Var of descriptional complexity, which gives the minimal number of nonterminals which is necessary to generate t...
Jürgen Dassow, Ralf Stiebe
MICS
2010
77views more  MICS 2010»
13 years 6 months ago
Preemptive Scheduling of Equal-Length Jobs in Polynomial Time
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighte...
George B. Mertzios, Walter Unger
FLAIRS
2008
13 years 10 months ago
One-Pass Learning Algorithm for Fast Recovery of Bayesian Network
An efficient framework is proposed for the fast recovery of Bayesian network classifier. A novel algorithm, called Iterative Parent-Child learningBayesian Network Classifier (IPC-...
Shunkai Fu, Michel Desmarais, Fan Li
CVPR
2008
IEEE
14 years 9 months ago
Conditional density learning via regression with application to deformable shape segmentation
Many vision problems can be cast as optimizing the conditional probability density function p(C|I) where I is an image and C is a vector of model parameters describing the image. ...
Jingdan Zhang, Shaohua Kevin Zhou, Dorin Comaniciu...
CDC
2008
IEEE
111views Control Systems» more  CDC 2008»
14 years 2 months ago
A separation principle for linear switching systems and parametrization of all stabilizing controllers
In this paper, we investigate the problem of designing a switching compensator for a plant switching amongst a (finite) family of given configurations (Ai,Bi,Ci). We assume that...
Franco Blanchini, Stefano Miani, Fouad Mesquine