Sciweavers

432 search results - page 32 / 87
» An optimal algorithm for the distinct elements problem
Sort
View
JCT
1998
99views more  JCT 1998»
13 years 8 months ago
From Hall's Matching Theorem to Optimal Routing on Hypercubes
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the s...
Shuhong Gao, Beth Novick, Ke Qiu
INFOCOM
2006
IEEE
14 years 2 months ago
Complexity of Wavelength Assignment in Optical Network Optimization
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...
Matthew Andrews, Lisa Zhang
MOBICOM
2009
ACM
14 years 3 months ago
Optimal beam scheduling for multicasting in wireless networks
We consider the problem of efficient link-layer multicasting in wireless networks with switched beamforming antennas. The inherent tradeoff between multicasting and beamforming ...
Karthikeyan Sundaresan, Kishore Ramachandran, Samp...
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
13 years 8 months ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...
NOCS
2007
IEEE
14 years 3 months ago
Implementing DSP Algorithms with On-Chip Networks
Many DSP algorithms are very computationally intensive. They are typically implemented using an ensemble of processing elements (PEs) operating in parallel. The results from PEs n...
Xiang Wu, Tamer Ragheb, Adnan Aziz, Yehia Massoud