Sciweavers

5115 search results - page 912 / 1023
» On Randomized Lanczos Algorithms
Sort
View
SPIRE
2010
Springer
15 years 4 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
TAP
2010
Springer
191views Hardware» more  TAP 2010»
15 years 4 months ago
Mesh saliency and human eye fixations
raction, simplification, segmentation, illumination, rendering, and illustration. Even though this technique is inspired by models of low-level human vision, it has not yet been v...
Youngmin Kim, Amitabh Varshney, David W. Jacobs, F...
TCOM
2010
92views more  TCOM 2010»
15 years 4 months ago
Detection of Gaussian constellations in MIMO systems under imperfect CSI
Abstract—This paper considers the problem of Gaussian symbols detection in MIMO systems in the presence of channel estimation errors. Under this framework we develop a computatio...
Ido Nevat, Gareth W. Peters, Jinhong Yuan
VTC
2010
IEEE
114views Communications» more  VTC 2010»
15 years 4 months ago
On Non-Stationary Urban Macrocell Channels in a Cooperative Downlink Beamforming Scenario
—A common simplification in the treatment of random linear channels is the assumption of stationarity of the channel in time. The wireless channel is, however, known to be inher...
Adrian Ispas, Gerd Ascheid, Christian Schneider, R...
CSREASAM
2010
15 years 4 months ago
Traffic Management and Security Based on Priority Queueing and Multicore Firewall Implementation
We consider the telematics appliances, such as firewall, as a basic part of security system with specific preemptive priority queuing and access control algorithm oriented on multi...
Vladimir S. Zaborovsky, Vladimir Mulukha, Sergey K...