Sciweavers

366 search results - page 13 / 74
» fast 2011
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
Fast algorithm for beamforming problems in distributed communication of relay networks
A sequential quadratic programming (SQP) method is proposed to solve the distributed beamforming problem in multiple relay networks. The problem is formulated as the minimization ...
Cong Sun, Yaxiang Yuan
INFOCOM
2011
IEEE
14 years 1 months ago
Scheduling in mapreduce-like systems for fast completion time
Abstract—Large-scale data processing needs of enterprises today are primarily met with distributed and parallel computing in data centers. MapReduce has emerged as an important p...
Hyunseok Chang, Murali S. Kodialam, Ramana Rao Kom...
CPHYSICS
2011
267views Education» more  CPHYSICS 2011»
14 years 1 months ago
Fast alignment of a complex tracking detector using advanced track models
The inner silicon detector of the Compact Muon Solenoid experiment (CMS) at CERN’s LHC consists of 16 588 modules. Charged-particle tracks in the detector are used to improve th...
Volker Blobel, Claus Kleinwort, Frank Meier
ICCV
2011
IEEE
13 years 9 months ago
Fast Removal of Non-uniform Camera Shake
Camera shake leads to non-uniform image blurs. Stateof-the-art methods for removing camera shake model the blur as a linear combination of homographically transformed versions of ...
Michael Hirsch, Christian Schuler, Stefan Harmelin...
ARITH
2011
IEEE
13 years 9 months ago
Fast Ripple-Carry Adders in Standard-Cell CMOS VLSI
— This paper presents a number of new high-radix ripple-carry adder designs based on Ling’s addition technique and a recently-published expansion thereof. The proposed adders a...
Neil Burgess