Sciweavers

4218 search results - page 682 / 844
» Complete sets of cooperations
Sort
View
JUCS
2007
148views more  JUCS 2007»
13 years 9 months ago
Analysis of two Sweep-line Algorithms for Constructing Spanning Trees and Steiner Trees
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
Adrian Dumitrescu, Csaba D. Tóth
TWC
2008
117views more  TWC 2008»
13 years 9 months ago
On the design, selection algorithm and performance analysis of limited feedback transmit beamforming
Multiple-input multiple-output (MIMO) systems achieve significant diversity and array gains by using transmit beamforming. When complete channel state information (CSI) is not avai...
Alireza Ghaderipoor, Chintha Tellambura
ANOR
2004
116views more  ANOR 2004»
13 years 9 months ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys
AUTOMATICA
2004
47views more  AUTOMATICA 2004»
13 years 9 months ago
Multi-input digital frequency stabilization of monolithic lasers
A digital control application for the frequency stabilization of optical frequency standards is presented. The standard employed is a monolithic neodymium in yttrium aluminum garn...
Enrico S. Canuto, Andrea Rolino
CG
2004
Springer
13 years 9 months ago
Time-critical rendering for time-varying volume data
In this paper, we present a novel method to meet the time-critical requirement in rendering time-varying volume data. In time-critical rendering, the rendering is demanded to be c...
Shih-Kuan Liao, Jim Z. C. Lai, Yeh-Ching Chung