2031 search results - page 222 / 407 » On Tree-Constrained Matchings and Generalizations |
102
Voted
ASIACRYPT
2005
Springer
15 years 4 months ago
2005
Springer
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
COLT
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. We derive upper and lower bounds for some statistical estimation problems. The upper bounds are established for the Gibbs algorithm. The lower bounds, applicable for all ...
122
Voted
MFCS
2005
Springer
15 years 4 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
104
click to vote
ISCAS
2003
IEEE
15 years 4 months ago
2003
IEEE
We present an equation-based transistor size optimizer that minimizes delay of custom circuits. Our method uses static timing analysis to find the critical paths and numerical met...
88
Voted
COMPGEOM
2003
ACM
15 years 4 months ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...