7106 search results - page 353 / 1422 » Restricted Complexity, General Complexity |
128
click to vote
ESORICS
2006
Springer
15 years 8 months ago
2006
Springer
We study the problem of Secure Multi-party Computation (SMC) in a model where individual processes contain a tamper-proof security module, and introduce the TrustedPals framework, ...
146
click to vote
FOSSACS
2008
Springer
15 years 6 months ago
2008
Springer
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter au...
142
click to vote
NIPS
2007
15 years 6 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
132
click to vote
UAI
2003
15 years 6 months ago
2003
The paper studies empirically the time-space trade-off between sampling and inference in the cutset sampling algorithm. The algorithm samples over a subset of nodes in a Bayesian ...
156
Voted
JIB
2008
15 years 5 months ago
2008
Biological data is often structured in the form of complex interconnected networks such as protein interaction and metabolic networks. In this paper, we investigate a new problem ...