1055 search results - page 147 / 211 » Enumerations in computable structure theory |
PODS
2008
ACM
14 years 10 months ago
2008
ACM
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
ISSAC
2007
Springer
14 years 4 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
PODC
2010
ACM
14 years 2 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
ATAL
2009
Springer
14 years 4 months ago
2009
Springer
Computational modeling of human belief maintenance and decision-making processes has become increasingly important for a wide range of applications. We present a framework for mod...
DRM
2007
Springer
14 years 4 months ago
2007
Springer
The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible...