Sciweavers

8431 search results - page 1325 / 1687
» Algorithmically Independent Sequences
Sort
View
COCOON
2007
Springer
16 years 26 days ago
Can a Graph Have Distinct Regular Partitions?
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
Noga Alon, Asaf Shapira, Uri Stav
CONCUR
2007
Springer
16 years 26 days ago
Timed Concurrent Game Structures
Abstract. We propose a new model for timed games, based on concurrent game structures (CGSs). Compared to the classical timed game automata of Asarin et al. [8], our timed CGSs are...
Thomas Brihaye, François Laroussinie, Nicol...
CTRSA
2007
Springer
111views Cryptology» more  CTRSA 2007»
16 years 26 days ago
A Practical and Tightly Secure Signature Scheme Without Hash Function
In 1999, two signature schemes based on the flexible RSA problem (a.k.a. strong RSA problem) were independently introduced: the Gennaro-Halevi-Rabin (GHR) signature scheme and the...
Benoît Chevallier-Mames, Marc Joye
ECOWS
2007
Springer
16 years 26 days ago
A Framework for Dynamic Web Services Composition
Dynamic composition of web services is a promising approach and at the same time a challenging research area for the dissemination of serviceoriented applications. It is widely rec...
Freddy Lécué, Eduardo Silva, Lu&iacu...
GECCO
2007
Springer
198views Optimization» more  GECCO 2007»
16 years 26 days ago
On the design of optimisers for surface reconstruction
In many industrial applications the need for an efficient and high-quality reconstruction of free-form surfaces does exist. Surface Reconstruction – the generation of CAD models...
Tobias Wagner, Thomas Michelitsch, Alexei Sacharow
« Prev « First page 1325 / 1687 Last » Next »