644 search results - page 35 / 129 » Decomposition Complexity |
91
Voted
ICAC
2007
IEEE
15 years 7 months ago
2007
IEEE
In today’s complex and highly dynamic computing environments, systems/services have to be constantly adjusted to meet Service Level Agreements (SLAs) and to improve resource uti...
81
Voted
PKC
2007
Springer
15 years 6 months ago
2007
Springer
Damg˚ard et al. [11] showed a novel technique to convert a polynomial sharing of secret a into the sharings of the bits of a in constant rounds, which is called the bit-decomposit...
105
click to vote
ICDT
2001
ACM
15 years 5 months ago
2001
ACM
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
134
click to vote
CA
1998
IEEE
15 years 4 months ago
1998
IEEE
We present a new approach for establishing correspondence between two homeomorphic 3D polyhedral models. The user can specify corresponding feature pairs on the polyhedra with a s...
173
Voted
FOCS
1997
IEEE
15 years 4 months ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...