8141 search results - page 1379 / 1629 » Higher Order Generalization |
137
click to vote
EUROCRYPT
2007
Springer
15 years 10 months ago
2007
Springer
Protocols proven secure within the universal composability (UC) framework satisfy strong and desirable security properties. Unfortunately, it is known that within the “plain” m...
131
click to vote
HM
2007
Springer
15 years 10 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
124
click to vote
IWMM
2007
Springer
15 years 10 months ago
2007
Springer
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
142
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
169
click to vote
TSD
2007
Springer
15 years 10 months ago
2007
Springer
The world wide web is a natural setting for cross-lingual information retrieval. The European Union is a typical example of a multilingual scenario, where multiple users have to de...