769 search results - page 135 / 154 » Where Is the Proof |
127
click to vote
IFIP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We present an analysis that determines when it is possible to multiplex a pair of cryptographic protocols. We present a transformation that improves the coverage of this ...
135
click to vote
SSD
2009
Springer
15 years 10 months ago
2009
Springer
A key issue in clustering data, regardless the algorithm used, is the definition of a distance function. In the case of trajectory data, different distance functions have been pro...
119
click to vote
UC
2009
Springer
15 years 10 months ago
2009
Springer
In this note we investigate the problem of computing the domain of attraction of a flow on R2 for a given attractor. We consider an operator that takes two inputs, the description...
136
click to vote
ACSC
2008
IEEE
15 years 10 months ago
2008
IEEE
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
131
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...