Sciweavers

9572 search results - page 1882 / 1915
» Cover Algorithms and Their Combination
Sort
View
BMCBI
2006
113views more  BMCBI 2006»
13 years 11 months ago
GibbsST: a Gibbs sampling method for motif discovery with enhanced resistance to local optima
Background: Computational discovery of transcription factor binding sites (TFBS) is a challenging but important problem of bioinformatics. In this study, improvement of a Gibbs sa...
Kazuhito Shida
CI
2006
101views more  CI 2006»
13 years 11 months ago
Sentiment Classification of Movie Reviews Using Contextual Valence Shifters
We present two methods for determining the sentiment expressed by a movie review. The semantic orientation of a review can be positive, negative, or neutral. We examine the effect...
Alistair Kennedy, Diana Inkpen
COMGEO
2006
ACM
13 years 11 months ago
Cost prediction for ray shooting in octrees
The ray shooting problem arises in many different contexts and is a bottleneck of ray tracing in computer graphics. Unfortunately, theoretical solutions to the problem are not ver...
Boris Aronov, Hervé Brönnimann, Allen ...
CONSTRAINTS
2006
105views more  CONSTRAINTS 2006»
13 years 11 months ago
Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction
Constraint satisfaction problems (CSPs) sometimes contain both variable symmetries and value symmetries, causing adverse effects on CSP solvers based on tree search. As a remedy, s...
Y. Law, J. Lee
CORR
2006
Springer
152views Education» more  CORR 2006»
13 years 11 months ago
On Reduced Complexity Soft-Output MIMO ML detection
In multiple-input multiple-output (MIMO) fading channels maximum likelihood (ML) detection is desirable to achieve high performance, but its complexity grows exponentially with th...
Massimiliano Siti, Michael P. Fitz
« Prev « First page 1882 / 1915 Last » Next »