Sciweavers

106 search results - page 14 / 22
» Characterizing Minimal Interval Completions
Sort
View
BMCBI
2006
118views more  BMCBI 2006»
13 years 7 months ago
Identification of gene expression patterns using planned linear contrasts
Background: In gene networks, the timing of significant changes in the expression level of each gene may be the most critical information in time course expression profiles. With ...
Hao Li, Constance L. Wood, Yushu Liu, Thomas V. Ge...
KDD
2000
ACM
133views Data Mining» more  KDD 2000»
13 years 11 months ago
Data selection for support vector machine classifiers
The problem of extracting a minimal number of data points from a large dataset, in order to generate a support vector machine (SVM) classifier, is formulated as a concave minimiza...
Glenn Fung, Olvi L. Mangasarian
COR
2010
164views more  COR 2010»
13 years 7 months ago
The distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
B. Naderi, Rubén Ruiz
EMSOFT
2008
Springer
13 years 8 months ago
On the interplay of dynamic voltage scaling and dynamic power management in real-time embedded applications
Dynamic Voltage Scaling (DVS) and Dynamic Power Management (DPM) are two popular techniques commonly employed to save energy in real-time embedded systems. DVS policies aim at red...
Vinay Devadas, Hakan Aydin
IOR
2008
128views more  IOR 2008»
13 years 7 months ago
Promised Lead-Time Contracts Under Asymmetric Information
We study the important problem of how a supplier should optimally share the consequences of demand uncertainty (i.e., the cost of inventory excesses and shortages) with a retailer...
Holly Lutze, Özalp Özer