1066 search results - page 176 / 214 » Computing Private Set Operations with Linear Complexities |
69
Voted
VLSID
2005
IEEE
15 years 10 months ago
2005
IEEE
Polynomial expressions are used to approximate a wide variety of functions commonly found in signal processing and computer graphics applications. Computing these polynomial expre...
100
click to vote
ICPP
2008
IEEE
15 years 4 months ago
2008
IEEE
Despite great efforts on the design of ultra-reliable components, the increase of system size and complexity has outpaced the improvement of component reliability. As a result, fa...
HIPC
2004
Springer
15 years 3 months ago
2004
Springer
It is well known that in a typical real-time system, certain parameters, such as the execution time of a job, are not fixed numbers. In such systems, it is common to characterize ...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
In this paper we set the first steps towards the development of a commercially viable tool that uses evolutionary computation to address the Product to Shelf Allocation Problem (P...
ICSOC
2010
Springer
14 years 7 months ago
2010
Springer
In Service-Oriented Computing (SOC), fragmentation and merging of workflows are motivated by a number of concerns, among which we can cite design issues, performance, and privacy. ...