2430 search results - page 158 / 486 » Computing Tutte Polynomials |
156
click to vote
ICIP
2007
IEEE
15 years 11 months ago
2007
IEEE
— In a rice sorting system, the separation distance of one grain from another is determined by the amount of time taken to process the image of each grain. The closer the separat...
124
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, ...
135
click to vote
FUIN
2000
15 years 4 months ago
2000
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
196
click to vote
NC
2011
14 years 11 months ago
2011
We apply techniques from complexity theory to a model of biological cellular membranes known as membrane systems or P-systems. Like Boolean circuits, membrane systems are defined ...
153
click to vote
ICDE
2010
IEEE
16 years 4 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...