Sciweavers

619 search results - page 26 / 124
» Random Bichromatic Matchings
Sort
View
PKC
1999
Springer
115views Cryptology» more  PKC 1999»
14 years 1 months ago
Decision Oracles are Equivalent to Matching Oracles
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...
Helena Handschuh, Yiannis Tsiounis, Moti Yung
CORR
2007
Springer
137views Education» more  CORR 2007»
13 years 8 months ago
Bounds on the Network Coding Capacity for Wireless Random Networks
— Recently, it has been shown that the max flow capacity can be achieved in a multicast network using network coding. In this paper, we propose and analyze a more realistic mode...
Salah A. Aly, Vishal Kapoor, Jie Meng, Andreas Kla...
IVC
2007
121views more  IVC 2007»
13 years 8 months ago
Automatic selection of MRF control parameters by reactive tabu search
This paper presents an optimisation technique to automatically select a set of control parameters for a Markov Random Field. The method is based on the Reactive Tabu Search strate...
Umberto Castellani, Andrea Fusiello, Riccardo Gher...
ESA
2006
Springer
207views Algorithms» more  ESA 2006»
14 years 14 days ago
Cheating by Men in the Gale-Shapley Stable Matching Algorithm
Abstract. This paper addresses strategies for the stable marriage problem. For the Gale-Shapley algorithm with men proposing, a classical theorem states that it is impossible for e...
Chien-Chung Huang
ICASSP
2011
IEEE
13 years 15 days ago
A hybrid compressed sensing algorithm for sparse channel estimation in MIMO OFDM systems
Due to multipath delay spread and relatively high sampling rate in OFDM systems, the channel estimation is formulated as a sparse recovery problem, where a hybrid compressed sensi...
Chenhao Qi, Lenan Wu