3897 search results - page 175 / 780 » complexity 2010 |
103
click to vote
FC
2010
Springer
15 years 6 months ago
2010
Springer
We present a new construction of divisible e-cash that makes use of 1) a new generation method of the binary tree of keys; 2) a new way of using bounded accumulators. The transacti...
132
click to vote
IEEESCC
2010
IEEE
15 years 6 months ago
2010
IEEE
Abstract—Modern service-oriented systems have increasingly complex loosely-coupled architectures that often exhibit poor performance and resource efficiency and have high operat...
134
Voted
EUROPAR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. As heterogeneous computing platforms become more prevalent, the programmer must account for complex memory hierarchies in addition to the difficulties of parallel program...
127
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead emp...
105
Voted
GI
2010
Springer
15 years 1 months ago
2010
Springer
: A recurring manual task in data integration or ontology alignment is finding mappings between complex schemas. In order to reduce the manual effort, many matching algorithms for ...