2168 search results - page 122 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
154
click to vote
RECOMB
2000
Springer
15 years 7 months ago
2000
Springer
We present a lossless compression algorithm, GenCompress, for genetic sequences, based on searching for approximate repeats. Our algorithm achieves the best compression ratios for...
142
click to vote
CF
2005
ACM
15 years 6 months ago
2005
ACM
In modern superscalar processors, the complex instruction scheduler could form the critical path of the pipeline stages and limit the clock cycle time. In addition, complex schedu...
107
Voted
DATE
2010
IEEE
15 years 9 months ago
2010
IEEE
—With the prospect of atomic-scale computing, we study cumulative energy profiles of spin-spin interactions in nonferromagnetic lattices (Ising spin-glasses)—an established to...
139
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
As a new branch of biometrics, palmprint authentication has attracted increasing amount of attention because palmprints are abundant of line features so that low resolution images...
131
click to vote
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...