2191 search results - page 277 / 439 » Improving the Efficiency of Non-Deterministic Computations |
RECOMB
2005
Springer
14 years 10 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
PADS
2006
ACM
14 years 3 months ago
2006
ACM
A master/worker paradigm for executing large-scale parallel discrete event simulation programs over networkenabled computational resources is proposed and evaluated. In contrast t...
IPPS
1998
IEEE
14 years 1 months ago
1998
IEEE
In the study of PetaFlop project, Processor-In-Memory array was proposed to be a target architecture in achieving 1015 floating point operations per second computing performance. ...
RT
1998
Springer
14 years 1 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...
ICMAS
1998
13 years 11 months ago
1998
In this paper, we discuss two major tradeoffs, spatial and temporal tradeoffs, that appear when applying marketbased computing to multimedia network applications. The former appea...