6368 search results - page 1050 / 1274 » Modeling Problem Transformations based on Data Complexity |
187
click to vote
CRYPTO
2007
Springer
16 years 21 days 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...
185
click to vote
PLDI
2005
ACM
16 years 2 days ago
2005
ACM
Reuse of existing code from class libraries and frameworks is often difficult because APIs are complex and the client code required to use the APIs can be hard to write. We obser...
184
click to vote
ATAL
2003
Springer
15 years 11 months ago
2003
Springer
Decentralized control of a cooperative multi-agent system is the problem faced by multiple decision-makers that share a common set of objectives. The decision-makers may be robots...
142
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— The nullspace method is a powerful framework to solve the synthesis problem of fault detection filters in the most general setting. It is also well suited to address the least...
225
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
In this paper, we present a stochastic algorithm by effective Markov chain Monte Carlo (MCMC) for segmenting and reconstructing 3D scenes. The objective is to segment a range image...