Sciweavers

5580 search results - page 1106 / 1116
» Randomized priority algorithms
Sort
View
103
Voted
TSP
2008
115views more  TSP 2008»
14 years 11 months ago
Approximation Bounds for Semidefinite Relaxation of Max-Min-Fair Multicast Transmit Beamforming Problem
Consider a downlink multicast scenario where a base station equipped with multiple antennas wishes to simultaneously broadcast a number of signals to some given groups of users ove...
Tsung-Hui Chang, Zhi-Quan Luo, Chong-Yung Chi
VLSISP
2008
173views more  VLSISP 2008»
14 years 11 months ago
Fast Bit Gather, Bit Scatter and Bit Permutation Instructions for Commodity Microprocessors
Advanced bit manipulation operations are not efficiently supported by commodity word-oriented microprocessors. Programming tricks are typically devised to shorten the long sequence...
Yedidya Hilewitz, Ruby B. Lee
AI
2002
Springer
14 years 11 months ago
Ensembling neural networks: Many could be better than all
Neural network ensemble is a learning paradigm where many neural networks are jointly used to solve a problem. In this paper, the relationship between the ensemble and its compone...
Zhi-Hua Zhou, Jianxin Wu, Wei Tang
BMCBI
2004
126views more  BMCBI 2004»
14 years 11 months ago
A probabilistic model for the evolution of RNA structure
Background: For the purposes of finding and aligning noncoding RNA gene- and cis-regulatory elements in multiple-genome datasets, it is useful to be able to derive multi-sequence ...
Ian Holmes
COMCOM
2004
127views more  COMCOM 2004»
14 years 11 months ago
Traffic splitting in a network: split traffic models and applications
The contemporary high-speed networks, e.g. the Internet and asynchronous transfer mode (ATM) networks provide a convenient and cost-effective communication platform to carry the e...
Huei-Wen Ferng, Cheng-Ching Peng
« Prev « First page 1106 / 1116 Last » Next »