2474 search results - page 101 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
129
click to vote
ICPP
2002
IEEE
15 years 9 months ago
2002
IEEE
We develop efficient algorithms for problems in computational geometry—convex hull, smallest enclosing box, ECDF, two-set dominance, maximal points, all-nearest neighbor, and c...
147
click to vote
CASC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We propose exact, complete and efficient methods for 2 problems: First, the real solving of systems of two bivariate rational polynomials of arbitrary degree. This means ...
129
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quart...
150
click to vote
COCOA
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We present a branch-and-bound (bb) algorithm for the multiple sequence alignment problem (MSA), one of the most important problems in computational biology. The upper bou...
196
click to vote
NC
2011
14 years 11 months ago
2011
We apply techniques from complexity theory to a model of biological cellular membranes known as membrane systems or P-systems. Like Boolean circuits, membrane systems are defined ...