255 search results - page 41 / 51 » A new upper bound for the bipartite Ramsey problem |
153
click to vote
ISSAC
2009
Springer
16 years 19 days ago
2009
Springer
We describe a new LLL-type algorithm, H-LLL, that relies on Householder transformations to approximate the underlying Gram-Schmidt orthogonalizations. The latter computations are ...
174
Voted
STACS
2007
Springer
16 years 5 days ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
153
click to vote
WADS
2005
Springer
15 years 11 months ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
166
click to vote
SIAMJO
2002
15 years 5 months ago
2002
In this paper we propose a novel finite-horizon, discrete-time, time-varying filtering method based on the robust semidefinite programming (SDP) technique. The proposed method prov...
162
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
The notion of distributed functional monitoring was recently introduced by Cormode, Muthukrishnan and Yi [CMY08] to initiate a formal study of the communication cost of certain fu...