Sciweavers

9997 search results - page 233 / 2000
» The case for crowd computing
Sort
View
RTSS
2008
IEEE
16 years 16 days ago
Symbolic Computation of Schedulability Regions Using Parametric Timed Automata
In this paper, we address the problem of symbolically computing the region in the parameter’s space that guarantees a feasible schedule, given a set of real-time tasks character...
Alessandro Cimatti, Luigi Palopoli, Yusi Ramadian
PAKDD
2010
ACM
182views Data Mining» more  PAKDD 2010»
15 years 10 months ago
Computation of Ratios of Secure Summations in Multi-party Privacy-Preserving Latent Dirichlet Allocation
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...
Bin Yang, Hiroshi Nakagawa
ISPD
1998
ACM
99views Hardware» more  ISPD 1998»
15 years 9 months ago
New efficient algorithms for computing effective capacitance
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...
Andrew B. Kahng, Sudhakar Muddu
AAAI
2008
15 years 7 months ago
Computer-Aided Proofs of Arrow's and Other Impossibility Theorems
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...
Fangzhen Lin, Pingzhong Tang
156
Voted
EWC
2008
117views more  EWC 2008»
15 years 6 months ago
Performance of parallel computations with dynamic processor allocation
In parallel adaptive mesh refinement (AMR) computations the problem size can vary significantly during a simulation. The goal here is to explore the performance implications of dyn...
Saeed Iqbal, Graham F. Carey