27 search results - page 5 / 6 » Integer Relations Among Algebraic Numbers |
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
SIAMCOMP
2010
13 years 6 months ago
2010
We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the ...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...
CIAC
2000
Springer
13 years 12 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
MMB
2010
Springer
14 years 12 days ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...