15777 search results - page 3082 / 3156 » Software Engineering |
150
Voted
FSTTCS
2009
Springer
15 years 9 months ago
2009
Springer
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
104
click to vote
FSTTCS
2009
Springer
15 years 9 months 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 ...
129
Voted
FSTTCS
2009
Springer
15 years 9 months 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) ...
145
Voted
FSTTCS
2009
Springer
15 years 9 months 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...
150
click to vote
OOPSLA
2009
Springer
15 years 9 months ago
2009
Springer
Programmers build large-scale systems with multiple languages to reuse legacy code and leverage languages best suited to their problems. For instance, the same program may use Jav...