Sciweavers

4451 search results - page 93 / 891
» On Random Ordering Constraints
Sort
View
CVPR
2009
IEEE
16 years 11 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
NIPS
2008
15 years 5 months ago
On Computational Power and the Order-Chaos Phase Transition in Reservoir Computing
Randomly connected recurrent neural circuits have proven to be very powerful models for online computations when a trained memoryless readout function is appended. Such Reservoir ...
Benjamin Schrauwen, Lars Buesing, Robert A. Legens...
EOR
2008
95views more  EOR 2008»
15 years 4 months ago
Augmenting the lot sizing order quantity when demand is probabilistic
In this paper we consider a single item, discrete time, lot sizing situation where demand is random and its parameters (e.g., mean and standard deviation) can change with time. Fo...
I. Nyoman Pujawan, Edward A. Silver
TWC
2008
110views more  TWC 2008»
15 years 4 months ago
Information outage probability and diversity order of symmetric coordinate interleaved orthogonal designs
Space-time block codes (STBCs) from coordinate interleaved orthogonal designs (CIODs) have attracted considerable attention lately due to their full-diversity and single-symbol dec...
Hoojin Lee, Jeffrey G. Andrews, Edward J. Powers
ITCC
2005
IEEE
15 years 10 months ago
On the Masking Countermeasure and Higher-Order Power Analysis Attacks
Abstract— Masking is a general method used to thwart Differential Power Analysis, in which all the intermediate data inside an implementation are XORed with random Boolean values...
François-Xavier Standaert, Eric Peeters, Je...