Sciweavers

274 search results - page 46 / 55
» When Two Case Bases Are Better than One: Exploiting Multiple...
Sort
View
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
14 years 24 days ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
SCHEDULING
2011
13 years 2 months ago
On robust online scheduling algorithms
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobsâ€...
Michael Gatto, Peter Widmayer
IJIT
2004
13 years 8 months ago
Computing Entropy for Ortholog Detection
Abstract-- Biological sequences from different species are called orthologs if they evolved from a sequence of a common ancestor species and they have the same biological function....
Hsing-Kuo Pao, John Case
ICC
2008
IEEE
136views Communications» more  ICC 2008»
14 years 1 months ago
New Beamforming Schemes with Optimum Receive Combining for Multiuser MIMO systems
— In this paper, we present a new beamforming scheme for a downlink of multiuser multiple-input multipleoutput (MIMO) communication systems. Recently, a blockdiagonalization (BD)...
Sang-Rim Lee, Seokhwan Park, Sung Hyun Moon, Inkyu...
BMCBI
2005
122views more  BMCBI 2005»
13 years 7 months ago
GenClust: A genetic algorithm for clustering gene expression data
Background: Clustering is a key step in the analysis of gene expression data, and in fact, many classical clustering algorithms are used, or more innovative ones have been designe...
Vito Di Gesù, Raffaele Giancarlo, Giosu&egr...