5624 search results - page 570 / 1125 » On Conditional Covering Problem |
187
click to vote
SAC
2009
ACM
2009
ACM
On the practical importance of communication complexity for secure multi-party computation protocols
16 years 1 months ago
Many advancements in the area of Secure Multi-Party Computation (SMC) protocols use improvements in communication complexity as a justification. We conducted an experimental stud...
204
click to vote
ICST
2009
IEEE
16 years 1 months ago
2009
IEEE
The problem of testing from an extended finite state machine (EFSM) can be expressed in terms of finding suitable paths through the EFSM and then deriving test data to follow the ...
190
click to vote
MKM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Recent work has detailed the conditions under which univariate Laurent polynomials have functional decompositions. This paper presents algorithms to compute such univaria...
163
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— This article addresses the invertibility problem for switched nonlinear systems affine in controls. The problem is concerned with finding the input and switching signal uniqu...
157
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— We describe a distributed algorithm for solving the rendezvous problem based on consensus protocols. We extend our previous work by considering the case when the evolution of t...