Sciweavers

31 search results - page 3 / 7
» Effective Capacity and Randomness of Closed Sets
Sort
View
CCGRID
2005
IEEE
14 years 1 months ago
n-Cycle: a set of algorithms for task distribution on a commodity grid
— The global internet is rich in commodity resources but scarce in specialized resources. We argue that a grid framework can achieve better performance if it separates management...
Ladislau Bölöni, Damla Turgut, Dan C. Ma...
IWCMC
2009
ACM
14 years 1 months ago
Quantized transmit beamforming with antenna selection in a MIMO channel
For a point-to-point multi-input multi-output (MIMO) wireless channel, we propose a feedback scheme, which consists of transmit-antenna selection algorithm and beamforming quantiz...
Wiroonsak Santipach
SODA
1998
ACM
99views Algorithms» more  SODA 1998»
13 years 8 months ago
Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
Ashish Goel, Monika Rauch Henzinger, Serge A. Plot...
CORR
2007
Springer
176views Education» more  CORR 2007»
13 years 7 months ago
Crystallization in large wireless networks
—We analyze fading interference relay networks where M single-antenna source-destination terminal pairs communicate concurrently and in the same frequency band through a set of K...
Veniamin I. Morgenshtern, Helmut Bölcskei
ICCD
2000
IEEE
120views Hardware» more  ICCD 2000»
13 years 11 months ago
Equivalence Checking Combining a Structural SAT-Solver, BDDs, and Simulation
This paper presents a verification technique for functional comparison of large combinational circuits using a novel combination of known approaches. The idea is based on a tight...
Viresh Paruthi, Andreas Kuehlmann