4930 search results - page 738 / 986 » Learning minimal abstractions |
166
click to vote
CC
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. To reason about programs, dynamic optimizers and analysis tools use sampling to collect a dynamic call graph (DCG). However, sampling has not achieved high accuracy with ...
178
click to vote
CICLING
2007
Springer
16 years 25 days ago
2007
Springer
Finite-state technology is considered the preferred model for representing the phonology and morphology of natural languages. The attractiveness of this technology for natural lang...
177
click to vote
CRYPTO
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
193
click to vote
DAGM
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. We consider the problem of non-rigid, point-to-point registration of two 3D surfaces. To avoid restrictions on the topology, we represent the surfaces as a level-set of t...
164
click to vote
DEXA
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. Semantic matching of schemas in heterogeneous data sharing systems is time consuming and error prone. Existing mapping tools employ semi-automatic techniques for mapping ...