2168 search results - page 220 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
139
Voted
CSB
2002
IEEE
15 years 9 months ago
2002
IEEE
There is a pressing need to align growing set of expressed sequence tags (ESTs) to newly sequenced human genome. The problem is, however, complicated by the exon/intron structure ...
158
Voted
CEC
2005
IEEE
15 years 10 months ago
2005
IEEE
Energy minimization algorithms for bio-molecular systems are critical to applications such as the prediction of protein folding. Conventional energy minimization methods such as th...
126
click to vote
IWCMC
2006
ACM
15 years 10 months ago
2006
ACM
— In this paper we focus on characterizing the average end-to-end delay and maximum achievable per-node throughput in random access multihop wireless ad hoc networks with station...
147
click to vote
WCRE
2002
IEEE
15 years 9 months ago
2002
IEEE
Dynamic binary translators compile machine code from a source architecture to a target architecture at run time. Due to the hard time constraints of just-in-time compilation only ...
150
Voted
VISSYM
2004
15 years 6 months ago
2004
Scatterplots are widely used in exploratory data analysis and class visualization. The advantages of scatterplots are that they are easy to understand and allow the user to draw c...