Sciweavers

1424 search results - page 79 / 285
» Improving on Version Stamps
Sort
View
IPCO
1993
138views Optimization» more  IPCO 1993»
15 years 14 days ago
An efficient approximation algorithm for the survivable network design problem
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
Harold N. Gabow, Michel X. Goemans, David P. Willi...
ICASSP
2010
IEEE
14 years 11 months ago
A practical forwarding scheme for wireless relay channels based on the quantization of log-likelihood ratios
This paper considers a wireless relay network with one source, one relay, and one destination. We propose a low-complexity quantize-and-forward (QF) scheme in which the relay calc...
Stefan Schwandter, Gerald Matz
59
Voted
CORR
2010
Springer
71views Education» more  CORR 2010»
14 years 11 months ago
Cobham's theorem for substitutions
The seminal theorem of Cobham has given rise during the last 40 years to a lot of works around non-standard numeration systems and has been extended to many contexts. In this paper...
Fabien Durand
80
Voted
CORR
2006
Springer
111views Education» more  CORR 2006»
14 years 11 months ago
Length-based cryptanalysis: The case of Thompson's Group
The length-based approach is a heuristic for solving randomly generated equations in groups which possess a reasonably behaved length function. We describe several improvements of ...
Dima Ruinskiy, Adi Shamir, Boaz Tsaban
MOC
2002
87views more  MOC 2002»
14 years 10 months ago
On the resolution of relative Thue equations
An efficient algorithm is given for the resolution of relative Thue equations. The essential improvement is the application of an appropriate version of Wildanger's enumeratio...
István Gaál, Michael Pohst