Sciweavers

851 search results - page 41 / 171
» Random constructions and density results
Sort
View
GLOBECOM
2009
IEEE
15 years 11 months ago
Carrier to Interference Ratio Analysis for the Shotgun Cellular System
—This paper analyzes the carrier-to-interference ratio of the so-called shotgun cellular system (SCS). In the SCS, basestations are placed randomly according to a two-dimensional...
Prasanna Madhusudhanan, Juan G. Restrepo, Youjian ...
170
Voted
ICIP
2002
IEEE
16 years 6 months ago
Optimal detector structure for DCT and subband domain watermarking
Most of the watermarking schemes that have been proposed until now employ a correlator in the detection stage. The current paper proposes a new detector scheme that can be applied...
Athanasios Nikolaidis, Ioannis Pitas
149
Voted
LATIN
2010
Springer
15 years 8 months ago
Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
149
Voted
SPAA
2003
ACM
15 years 10 months ago
A practical algorithm for constructing oblivious routing schemes
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
Marcin Bienkowski, Miroslaw Korzeniowski, Harald R...
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
16 years 5 months ago
Low-end uniform hardness vs. randomness tradeoffs for AM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
Ronen Shaltiel, Christopher Umans