2430 search results - page 339 / 486 » Computing Tutte Polynomials |
147
Voted
EUROPAR
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In this paper we propose an energy-efficient broadcast algorithm for wireless networks for the case where the transmission powers of the nodes are fixed. Our algorithm is...
133
click to vote
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manip...
142
Voted
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
140
Voted
ECCV
2006
Springer
15 years 7 months ago
2006
Springer
We propose a closed form solution for segmenting mixtures of 2-D translational and 2-D affine motion models directly from the image intensities. Our approach exploits the fact that...
142
click to vote
PKC
1998
Springer
15 years 7 months ago
1998
Springer
In this paper, we present two efficient algorithms computing scalar multiplications of a point in an elliptic curve defined over a small finite field, the Frobenius map of which ha...