1552 search results - page 264 / 311 » On the Complexity of Constant Propagation |
106
click to vote
SISAP
2009
IEEE
15 years 6 months ago
2009
IEEE
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
117
click to vote
AICCSA
2008
IEEE
15 years 6 months ago
2008
IEEE
During the last decades, performance of available hardware resources constantly increased [15], which enabled the assignment of more and more complex tasks to software systems. As...
128
click to vote
RTAS
2008
IEEE
15 years 6 months ago
2008
IEEE
Embedded systems are often subject to constraints that require determinism to ensure that task deadlines are met. Such systems are referred to as real-time systems. Schedulability...
101
click to vote
CRYPTO
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
128
click to vote
FC
2007
Springer
15 years 6 months ago
2007
Springer
Task-specific groups are often formed in an ad-hoc manner within big structures, like companies. Take the following typical scenario: A high rank manager decides that a task force...