Sciweavers

1639 search results - page 262 / 328
» Degree-constrained network flows
Sort
View
CCS
2010
ACM
13 years 11 months ago
Predictive black-box mitigation of timing channels
We investigate techniques for general black-box mitigation of timing channels. The source of events is wrapped by a timing mitigator that delays output events so that they contain...
Aslan Askarov, Danfeng Zhang, Andrew C. Myers
APJOR
2010
131views more  APJOR 2010»
13 years 11 months ago
Metric-Preserving Reduction of Earth Mover's Distance
Earth mover's distance (EMD for short) is a perceptually meaningful dissimilarity measure between histograms. The computation of EMD reduces to a network flow optimization pro...
Yuichi Takano, Yoshitsugu Yamamoto
COR
2008
88views more  COR 2008»
13 years 11 months ago
Solving the swath segment selection problem through Lagrangean relaxation
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
Roberto Cordone, Federico Gandellini, Giovanni Rig...
ENVSOFT
2010
161views more  ENVSOFT 2010»
13 years 11 months ago
Graphical user interface for rapid set-up of SHETRAN physically-based river catchment model
The SHETRAN physically-based distributed rainfall-runoff modelling system gives detailed simulations in time and space of water flow and sediment and solute transport in river cat...
Stephen J. Birkinshaw, Philip James, John Ewen
JMLR
2006
115views more  JMLR 2006»
13 years 11 months ago
Structured Prediction, Dual Extragradient and Bregman Projections
We present a simple and scalable algorithm for maximum-margin estimation of structured output models, including an important class of Markov networks and combinatorial models. We ...
Benjamin Taskar, Simon Lacoste-Julien, Michael I. ...