10271 search results - page 1950 / 2055 » Computational science |
182
click to vote
ERSHOV
2009
Springer
16 years 17 days ago
2009
Springer
Abstract. Debugging virtual machines (VMs) presents unique challenges, especially meta-circular VMs, which are written in the same language they implement. Making sense of runtime ...
139
click to vote
FSTTCS
2009
Springer
16 years 17 days ago
2009
Springer
ABSTRACT. We study functionally private approximations. An approximation function g is functionally private with respect to f if, for any input x, g(x) reveals no more information ...
161
click to vote
FSTTCS
2009
Springer
16 years 17 days ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
182
click to vote
FSTTCS
2009
Springer
16 years 17 days ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
190
Voted
ICMT
2009
Springer
16 years 16 days ago
2009
Springer
Abstract. The QVT Relations (QVT-R) transformation language allows the definition of bidirectional model transformations, which are required in cases where a two (or more) models ...