Sciweavers

308 search results - page 45 / 62
» Tight Lower Bounds for the Distinct Elements Problem
Sort
View
SODA
2010
ACM
371views Algorithms» more  SODA 2010»
15 years 7 months ago
Online Learning with Queries
The online learning problem requires a player to iteratively choose an action in an unknown and changing environment. In the standard setting of this problem, the player has to ch...
Chao-Kai Chiang, Chi-Jen Lu
74
Voted
ESA
2005
Springer
161views Algorithms» more  ESA 2005»
15 years 3 months ago
Cache-Oblivious Comparison-Based Algorithms on Multisets
Abstract. We study three comparison-based problems related to multisets in the cache-oblivious model: Duplicate elimination, multisorting and finding the most frequent element (th...
Arash Farzan, Paolo Ferragina, Gianni Franceschini...
INFOCOM
2009
IEEE
15 years 4 months ago
Minimum Maximum Degree Publish-Subscribe Overlay Network Design
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
Melih Onus, Andréa W. Richa
ICC
2008
IEEE
105views Communications» more  ICC 2008»
15 years 4 months ago
Scheduling and Pre-Conditioning in Multi-User MIMO TDD Systems
Abstract—The downlink transmission in multi-user multipleinput multiple-output (MIMO) systems has been extensively studied from both communication-theoretic and information-theor...
Jubin Jose, Alexei Ashikhmint, Phil Whiting, Srira...
INFORMATICALT
2010
88views more  INFORMATICALT 2010»
14 years 8 months ago
Inapproximability Results for Wavelength Assignment in WDM Optical Networks
We address the issue of inapproximability of the wavelength assignment problem in wavelength division multiplexing (WDM) optical networks. We prove that in an n-node WDM optical ne...
Keqin Li