Sciweavers

600 search results - page 61 / 120
» Problems and results in extremal combinatorics - II
Sort
View
TCBB
2008
122views more  TCBB 2008»
13 years 9 months ago
Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ra...
ML
2002
ACM
127views Machine Learning» more  ML 2002»
13 years 9 months ago
Sparse Regression Ensembles in Infinite and Finite Hypothesis Spaces
We examine methods for constructing regression ensembles based on a linear program (LP). The ensemble regression function consists of linear combinations of base hypotheses generat...
Gunnar Rätsch, Ayhan Demiriz, Kristin P. Benn...
CDC
2009
IEEE
164views Control Systems» more  CDC 2009»
13 years 7 months ago
Real-time MPC - Stability through robust MPC design
Recent results have suggested that online Model Predictive Control (MPC) can be computed quickly enough to control fast sampled systems. High-speed applications impose a hard real-...
Melanie Nicole Zeilinger, Colin Neil Jones, Davide...
ICASSP
2009
IEEE
13 years 7 months ago
Robust joint localization and time synchronization in wireless sensor networks with bounded anchor uncertainties
A unified framework to jointly solve the two problems of localization and synchronization at the same time is presented in this paper. The joint approach is attractive because it ...
Jun Zheng, Yik-Chung Wu
ISCAS
2005
IEEE
138views Hardware» more  ISCAS 2005»
14 years 2 months ago
Transition time bounded low-power clock tree construction
— Recently power becomes a significant issue in clock network design for high-performance ICs because the clock network consumes a large portion of the total power in the whole s...
Min Pan, Chris C. N. Chu, J. Morris Chang