Sciweavers

2598 search results - page 334 / 520
» Experimental Design for Variable Selection in Data Bases
Sort
View
AOSD
2008
ACM
15 years 8 months ago
Edicts: implementing features with flexible binding times
In a software product line, the binding time of a feature is the time at which one decides to include or exclude a feature from a product. Typical binding site implementations are...
Venkat Chakravarthy, John Regehr, Eric Eide
BMCBI
2007
197views more  BMCBI 2007»
15 years 6 months ago
Boolean networks using the chi-square test for inferring large-scale gene regulatory networks
Background: Boolean network (BN) modeling is a commonly used method for constructing gene regulatory networks from time series microarray data. However, its major drawback is that...
Haseong Kim, Jae K. Lee, Taesung Park
BMCBI
2010
183views more  BMCBI 2010»
15 years 6 months ago
SOPRA: Scaffolding algorithm for paired reads via statistical optimization
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...
Adel Dayarian, Todd P. Michael, Anirvan M. Sengupt...
ICRA
2007
IEEE
153views Robotics» more  ICRA 2007»
16 years 23 days ago
A practical Visual Servo Control for a Unmanned Aerial Vehicle
— An image-based visual servo control is presented for an Unmanned aerial vehicle (UAV) capable of stationary or quasi-stationary flight. The proposed control design addresses v...
Nicolas Guenard, Tarek Hamel, Robert E. Mahony
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
16 years 1 months ago
Primal sparse Max-margin Markov networks
Max-margin Markov networks (M3 N) have shown great promise in structured prediction and relational learning. Due to the KKT conditions, the M3 N enjoys dual sparsity. However, the...
Jun Zhu, Eric P. Xing, Bo Zhang