4403 search results - page 244 / 881 » Galois Theory of Algorithms |
205
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
222
click to vote
KDD
2010
ACM
15 years 5 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
206
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
171
click to vote
MICCAI
2005
Springer
16 years 8 months ago
2005
Springer
Abstract. This paper presents a new algorithm for non-rigid registration between two doubly-connected regions. Our algorithm is based on harmonic analysis and the theory of optimal...
178
click to vote
GLOBECOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— In this paper, we propose an analytical model to capture the dynamics of the RED algorithm. We first develop a system of recursive equations that describes the packet dropping...