2899 search results - page 465 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
108
click to vote
PR
2007
15 years 1 months ago
2007
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
108
click to vote
INFOCOM
2010
IEEE
15 years 1 days ago
2010
IEEE
Abstract—We provide a formal model for the Change Management process for Enterprise IT systems, and develop change scheduling algorithms that seek to attain the “change capacit...
119
click to vote
PE
2010
Springer
14 years 12 months ago
2010
Springer
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
141
click to vote
JMLR
2010
14 years 8 months ago
2010
An exceedingly large number of scientific and engineering fields are confronted with the need for computer simulations to study complex, real world phenomena or solve challenging ...
114
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Abstract—Coping with outliers contaminating dynamical processes is of major importance in various applications because mismatches from nominal models are not uncommon in practice...