1941 search results - page 217 / 389 » On the Hardness of Approximate Reasoning |
137
click to vote
CRYPTO
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. In this paper, we study the existence of multicollisions in iterated hash functions. We show that finding multicollisions, i.e. r-tuples of messages that all hash to the...
183
click to vote
SGAI
2004
Springer
15 years 11 months ago
2004
Springer
We exploit the combinatorial structure of conceptual graphs in order to obtain faster execution time when computing projection, which is a core generalisation-specialisation relat...
161
click to vote
PG
2003
IEEE
15 years 11 months ago
2003
IEEE
We present a system based on commodity graphics hardware for computing global illumination in dynamic scenes at interactive rates. We designed a progressive global illumination al...
163
click to vote
ESA
2003
Springer
15 years 11 months ago
2003
Springer
We report on a project with a German car manufacturer. The task is to compute (approximate) solutions to a specific large-scale packing problem. Given a polyhedral model of a car ...
152
click to vote
HSNMC
2003
Springer
15 years 11 months ago
2003
Springer
The provision of Quality of Service (QoS) in a seamless way over the dominating internetworking protocol of our times (IP), has been a challenge for many researchers in the past ye...