321 search results - page 26 / 65 » Partitioning by iterative deletion |
EURODAC
1995
IEEE
14 years 1 months ago
1995
IEEE
: This paper introduces a modified relaxation approach that allows to improve the convergence of iterations while analyzing mixed systems with different simulators. The method redu...
JCT
2007
13 years 9 months ago
2007
In answer to a question of Andrews about finding combinatorial proofs of two identities in Ramanujan’s “lost” notebook, we obtain weighted forms of Euler’s theorem on part...
IMCSIT
2010
13 years 8 months ago
2010
Abstract--Recently, we have introduced an approach to multicore computations on sparse matrices using recursive partitioning, called Recursive Sparse Blocks (RSB). In this document...
COCOON
2007
Springer
14 years 4 months ago
2007
Springer
Given an RNA family characterized by conserved sequences and folding constraints, the problem is to search for all the instances of the RNA family in a genomic database. As seed-ba...
PODC
2010
ACM
14 years 2 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...