Sciweavers

2252 search results - page 150 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
109
Voted
STOC
2002
ACM
101views Algorithms» more  STOC 2002»
16 years 3 months ago
An exponential separation between regular and general resolution
: This paper gives two distinct proofs of an exponential separation between regular resolution and unrestricted resolution. The previous best known separation between these systems...
Michael Alekhnovich, Jan Johannsen, Toniann Pitass...
ECCC
2010
80views more  ECCC 2010»
15 years 3 months ago
Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...
Melanie Winkler, Berthold Vöcking, Sascha Geu...
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
16 years 3 months ago
On the fourier tails of bounded functions over the discrete cube
In this paper we consider bounded real-valued functions over the discrete cube, f : {-1, 1}n [-1, 1]. Such functions arise naturally in theoretical computer science, combinatorics...
Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Don...
130
Voted
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
15 years 10 months ago
On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources
Abstract. The throughput capacity of arbitrary wireless networks under the physical Signal to Interference Plus Noise Ratio (SINR) model has received a greater deal of attention in...
Chen Avin, Zvi Lotker, Yvonne Anne Pignolet
UAI
1992
15 years 4 months ago
Interval Structure: A Framework for Representing Uncertain Information
In this paper, a unified framework for representing uncertain information based on the notion of an interval structure is proposed. It is shown that the lower and upper approximat...
S. K. Michael Wong, Lusheng Wang, Yiyu Yao