4110 search results - page 606 / 822 » Efficient algorithms for the 2-gathering problem |
208
click to vote
RECOMB
1998
Springer
15 years 10 months ago
1998
Springer
Given a strong match between regions of two sequences, how far can the match be meaningfully extended if gaps are allowed in the resulting alignment? The aim is to avoid searching...
192
click to vote
RT
1998
Springer
15 years 10 months ago
1998
Springer
We describe an interactive system to reconstruct 3D geometry and extract textures from a set of photographs taken with arbitrary camera parameters. The basic idea is to let the use...
158
click to vote
SC
1993
ACM
15 years 10 months ago
1993
ACM
This paper documents the use of a massively parallel computer, specifically the Connection Machine CM-5, to solve the Boltzmann equation to model one-dimensional shock wave struct...
154
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
- For modern processor designs in nanometer technologies, both block and interconnect pipelining are needed to achieve multi-gigahertz clock frequency, but previous approaches cons...
171
click to vote
CASES
2007
ACM
15 years 10 months ago
2007
ACM
Delayed branching is a technique to alleviate branch hazards without expensive hardware branch prediction mechanisms. For VLIW processors with deep pipelines and many issue slots,...