16257 search results - page 272 / 3252 » D-finiteness: algorithms and applications |
167
click to vote
HPDC
1999
IEEE
15 years 11 months ago
1999
IEEE
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...
194
Voted
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
187
click to vote
FMCAD
2004
Springer
15 years 10 months ago
2004
Springer
This work presents a memory-efficient All-SAT engine which, given a propositional formula over sets of important and non-important variables, returns the set of all the assignments...
189
click to vote
VISSYM
2004
15 years 8 months ago
2004
We present a three pass occlusion culling algorithm, which makes efficient use of hardware support. Our geo-scientific sub-surface data sets consist typically of a set of high res...
176
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: In current comparative proteomics studies, the large number of images generated by 2D gels is currently compared using spot matching algorithms. Unfortunately, differe...