Sciweavers

311 search results - page 47 / 63
» Exploiting Decomposition in Constraint Optimization Problems
Sort
View
ATAL
2009
Springer
14 years 2 months ago
Computing optimal randomized resource allocations for massive security games
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
Christopher Kiekintveld, Manish Jain, Jason Tsai, ...
JSAC
2007
117views more  JSAC 2007»
13 years 7 months ago
Optimization of Training and Scheduling in the Non-Coherent SIMO Multiple Access Channel
— Channel state information (CSI) is important for achieving large rates in MIMO channels. However, in timevarying MIMO channels, there is a tradeoff between the time/energy spen...
Sugumar Murugesan, Elif Uysal-Biyikoglu, Philip Sc...
MP
2011
13 years 2 months ago
Statistical ranking and combinatorial Hodge theory
We propose a number of techniques for obtaining a global ranking from data that may be incomplete and imbalanced — characteristics that are almost universal to modern datasets co...
Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 7 months ago
Learning to rank with combinatorial Hodge theory
Abstract. We propose a number of techniques for learning a global ranking from data that may be incomplete and imbalanced -- characteristics that are almost universal to modern dat...
Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye
LPAR
2005
Springer
14 years 1 months ago
Incremental Integrity Checking: Limitations and Possibilities
Integrity checking is an essential means for the preservation of the intended semantics of a deductive database. Incrementality is the only feasible approach to checking and can be...
Henning Christiansen, Davide Martinenghi