21324 search results - page 357 / 4265 » Making the case for computing |
137
click to vote
TACAS
2010
Springer
15 years 12 months ago
2010
Springer
We address the problem of computing the information leakage of a system in an efficient way. We propose two methods: one based on reducing the problem to reachability, and the oth...
133
click to vote
IFIP
2009
Springer
15 years 11 months ago
2009
Springer
The fundamental Quality of Service (QoS) routing problem, which consists in determining paths subject to multiple QoS constraints, has been extensively investigated in the intra-do...
152
click to vote
PAKDD
2010
ACM
15 years 8 months ago
2010
ACM
In this paper, we focus our attention on the problem of computing the ratio of two numbers, both of which are the summations of the private numbers distributed in different parties...
133
Voted
ISPD
1998
ACM
15 years 8 months ago
1998
ACM
We describe a novel iterationless approach for computing the effective capacitance of an interconnect load at a driving gate output. Our new approach is considerably faster than p...
136
click to vote
AAAI
2008
15 years 6 months ago
2008
Arrow’s Impossibility Theorem is one of the landmark results in social choice theory. Over the years since the theorem was proved in 1950, quite a few alternative proofs have be...