Sciweavers

4155 search results - page 422 / 831
» External Memory Algorithms
Sort
View
JSC
2007
119views more  JSC 2007»
15 years 6 months ago
Equisingular calculations for plane curve singularities
We present an algorithm which, given a deformation with section of a reduced plane curve singularity, computes equations for the equisingularity stratum (that is, the µ-constant s...
Antonio Campillo, Gert-Martin Greuel, Christoph Lo...
CORR
2009
Springer
74views Education» more  CORR 2009»
15 years 4 months ago
Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed Programs
Previous work has shown that there are two major complexity barriers in the synthesis of fault-tolerant distributed programs, namely generation of fault-span, the set of states re...
Fuad Abujarad, Borzoo Bonakdarpour, Sandeep S. Kul...
ISI
2007
Springer
16 years 1 months ago
Using Digital Chains of Custody on Constrained Devices to Verify Evidence
—A digital chain of custody is an account documenting digital data at a particular place and time. This paper gives a method of validating and authenticating a digital chain of c...
Phillip G. Bradford, Daniel A. Ray
SPAA
1998
ACM
15 years 11 months ago
Fast Set Operations Using Treaps
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
Guy E. Blelloch, Margaret Reid-Miller
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
16 years 7 months ago
Linear degree extractors and the inapproximability of max clique and chromatic number
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
David Zuckerman