2657 search results - page 205 / 532 » On the complexity of hierarchical problem solving |
CORR
2007
Springer
15 years 1 months ago
2007
Springer
— Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem ar...
115
Voted
TCS
2008
15 years 1 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
118
click to vote
COMGEO
2011
ACM
14 years 8 months ago
2011
ACM
The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner et al. We provide efficient algorithms for the follo...
117
Voted
DATE
2010
IEEE
15 years 7 months ago
2010
IEEE
—1 In this paper we present a stochastic model order reduction technique for interconnect extraction in the presence of process variabilities, i.e. variation-aware extraction. It...
107
Voted
HSNMC
2004
Springer
15 years 7 months ago
2004
Springer
In this paper, we propose an end-to-end route optimization scheme for nested mobile networks, which we refer to as Recursive Binding Update plus (RBU+). A nested mobile network is ...