Sciweavers

2485 search results - page 128 / 497
» Time Bounded Frequency Computations
Sort
View
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
16 years 2 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...
CRYPTO
2010
Springer
170views Cryptology» more  CRYPTO 2010»
15 years 1 months ago
Securing Computation against Continuous Leakage
We present a general method to compile any cryptographic algorithm into one which resists side channel attacks of the only computation leaks information variety for an unbounded nu...
Shafi Goldwasser, Guy N. Rothblum
125
Voted
COR
2006
94views more  COR 2006»
15 years 5 months ago
Computing obnoxious 1-corner polygonal chains
We consider an obnoxious facility location problem in which the facility is a trajectory consisting of a bounded length polygonal chain of two edges having extremes anchored at tw...
José Miguel Díaz-Báñez...
ICC
2000
IEEE
15 years 9 months ago
Synchronizability of General Periodic Pattern Signals
— In this paper1 an optimum and sub-optimum maximum likelihood (ML) rule for joint frame and carrier frequency offset estimation are derived, which rely on the transmission of a...
Branimir Stantchev, Gerhard Fettweis
184
Voted
COCO
2005
Springer
153views Algorithms» more  COCO 2005»
15 years 10 months ago
Average-Case Computations - Comparing AvgP, HP, and Nearly-P
We examine classes of distributional problems defined in terms of polynomial-time decision algorithms with bounded error probability. The class AvgP [5] has been characterized in...
Arfst Nickelsen, Birgit Schelm