Sciweavers

269 search results - page 51 / 54
» A branch and bound method for stochastic global optimization
Sort
View
PAMI
2012
13 years 1 days ago
Angular Embedding: A Robust Quadratic Criterion
Abstract—Given the size and confidence of pairwise local orderings, angular embedding (AE) finds a global ordering with a nearglobal optimal eigensolution. As a quadratic crite...
Stella Yu
RTSS
2009
IEEE
15 years 4 months ago
Spatiotemporal Delay Control for Low-Duty-Cycle Sensor Networks
—Data delivery is a major function of sensor network applications. Many applications, such as military surveillance, require the detection of interested events to be reported to ...
Yu Gu, Tian He, Mingen Lin, Jinhui Xu
ML
2002
ACM
167views Machine Learning» more  ML 2002»
14 years 9 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...
BMCBI
2008
211views more  BMCBI 2008»
14 years 9 months ago
CPSP-tools - Exact and complete algorithms for high-throughput 3D lattice protein studies
Background: The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. ...
Martin Mann, Sebastian Will, Rolf Backofen
PE
2002
Springer
176views Optimization» more  PE 2002»
14 years 9 months ago
Effective bandwidth estimation and testing for Markov sources
This work addresses the resource sharing problem in broadband communication networks that can guarantee some quality of service (QoS), and develops some results about data source ...
Juan Pechiar, Gonzalo Perera, María Simon