Sciweavers

130 search results - page 26 / 26
» Secretary Problems via Linear Programming
Sort
View
CORR
2008
Springer
150views Education» more  CORR 2008»
13 years 10 months ago
Message-passing for Maximum Weight Independent Set
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
Sujay Sanghavi, Devavrat Shah, Alan S. Willsky
CN
2006
70views more  CN 2006»
13 years 9 months ago
Preventing persistent oscillations and loops in IBGP configuration with route reflection
Abstract-- Internal Border Gateway Protocol (IBGP) is responsible for distributing external reachability information, obtained via External-BGP (EBGP) sessions, within an autonomou...
Anuj Rawat, Mark A. Shayman
MOBIQUITOUS
2007
IEEE
14 years 4 months ago
Minimum Disruption Service Composition and Recovery over Mobile Ad Hoc Networks
— The dynamic nature of mobile ad hoc networks poses fundamental challenges to the design of service composition schemes that can minimize the effect of service disruptions. Alth...
Shanshan Jiang, Yuan Xue, Douglas C. Schmidt
KDD
2010
ACM
247views Data Mining» more  KDD 2010»
13 years 11 months ago
Active learning for biomedical citation screening
Active learning (AL) is an increasingly popular strategy for mitigating the amount of labeled data required to train classifiers, thereby reducing annotator effort. We describe ...
Byron C. Wallace, Kevin Small, Carla E. Brodley, T...
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
14 years 10 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu