Sciweavers

1381 search results - page 269 / 277
» Computational Complexity of Constraint Satisfaction
Sort
View
IJCAI
1989
13 years 8 months ago
Functional Representation of Designs and Redesign Problem Solving
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de­ sign task takes as input the specifications of the desired functions of a device...
Ashok K. Goel, B. Chandrasekaran
SIGCOMM
2010
ACM
13 years 7 months ago
Cloudward bound: planning for beneficial migration of enterprise applications to the cloud
In this paper, we tackle challenges in migrating enterprise services into hybrid cloud-based deployments, where enterprise operations are partly hosted on-premise and partly in th...
Mohammad Y. Hajjat, Xin Sun, Yu-Wei Eric Sung, Dav...
BMCBI
2010
95views more  BMCBI 2010»
13 years 7 months ago
Identifying main effects and epistatic interactions from large-scale SNP data via adaptive group Lasso
Background: Single nucleotide polymorphism (SNP) based association studies aim at identifying SNPs associated with phenotypes, for example, complex diseases. The associated SNPs m...
Can Yang, Xiang Wan, Qiang Yang, Hong Xue, Weichua...
BMCBI
2008
123views more  BMCBI 2008»
13 years 7 months ago
Statistical methodology for the analysis of dye-switch microarray experiments
Background: In individually dye-balanced microarray designs, each biological sample is hybridized on two different slides, once with Cy3 and once with Cy5. While this strategy ens...
Tristan Mary-Huard, Julie Aubert, Nadera Mansouri-...
JMLR
2008
230views more  JMLR 2008»
13 years 7 months ago
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
Michael Collins, Amir Globerson, Terry Koo, Xavier...