19 search results - page 2 / 4 » On the hardness of minkowski addition and related operations |
IJMMS
1998
13 years 5 months ago
1998
: Decision-support systems that help solving problems in open and weak theory domains, i.e. hard problems, need improved methods to ground their models in real world situations. Mo...
CTRSA
2011
Springer
12 years 8 months ago
2011
Springer
Non-malleability of a cryptographic primitive is a fundamental security property which ensures some sort of independence of cryptographic values. The notion has been extensively st...
WSDM
2009
ACM
14 years 3 days ago
2009
ACM
With the overwhelming number of reports on similar events originating from different sources on the web, it is often hard, using existing web search paradigms, to find the origi...
FAST
2007
13 years 6 months ago
2007
It is estimated that over 90% of all new information produced in the world is being stored on magnetic media, most of it on hard disk drives. Despite their importance, there is re...
ERLANG
2003
ACM
13 years 10 months ago
2003
ACM
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables...