787 search results - page 113 / 158 » Fully procedural graphics |
161
Voted
BMCBI
2011
14 years 4 months ago
2011
Background: Pairwise sequence alignment methods are widely used in biological research. The increasing number of sequences is perceived as one of the upcoming challenges for seque...
121
click to vote
CIKM
2005
Springer
15 years 6 months ago
2005
Springer
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
133
Voted
BMCBI
2005
15 years 18 days ago
2005
Background: Two central problems in computational biology are the determination of the alignment and phylogeny of a set of biological sequences. The traditional approach to this p...
JCO
2011
14 years 7 months ago
2011
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...
118
Voted
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
In many vision problems, instead of having fully annotated training data, it is easier to obtain just a subset of data with annotations, because it is less restrictive for the use...